/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:29:26,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:29:26,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:29:26,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:29:26,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:29:26,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:29:26,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:29:26,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:29:26,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:29:26,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:29:26,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:29:26,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:29:26,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:29:26,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:29:26,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:29:26,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:29:26,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:29:26,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:29:26,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:29:26,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:29:26,812 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:29:26,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:29:26,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:29:26,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:29:26,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:29:26,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:29:26,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:29:26,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:29:26,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:29:26,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:29:26,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:29:26,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:29:26,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:29:26,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:29:26,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:29:26,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:29:26,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:29:26,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:29:26,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:29:26,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:29:26,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:29:26,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:29:26,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:29:26,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:29:26,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:29:26,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:29:26,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:29:26,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:29:26,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:29:26,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:29:26,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:29:26,848 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:29:26,848 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 20:29:27,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:29:27,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:29:27,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:29:27,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:29:27,065 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:29:27,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-27 20:29:27,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04657957/1e46545ae981476f9a029982ead6601a/FLAGffd8b45c1 [2022-04-27 20:29:27,492 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:29:27,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-27 20:29:27,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04657957/1e46545ae981476f9a029982ead6601a/FLAGffd8b45c1 [2022-04-27 20:29:27,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04657957/1e46545ae981476f9a029982ead6601a [2022-04-27 20:29:27,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:29:27,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:29:27,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:29:27,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:29:27,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:29:27,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc75bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27, skipping insertion in model container [2022-04-27 20:29:27,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:29:27,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:29:27,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-04-27 20:29:27,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:29:27,681 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:29:27,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-04-27 20:29:27,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:29:27,708 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:29:27,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27 WrapperNode [2022-04-27 20:29:27,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:29:27,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:29:27,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:29:27,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:29:27,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:29:27,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:29:27,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:29:27,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:29:27,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (1/1) ... [2022-04-27 20:29:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:29:27,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:29:27,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 20:29:27,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 20:29:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:29:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:29:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:29:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:29:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:29:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:29:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:29:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:29:27,889 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:29:27,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:29:28,074 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:29:28,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:29:28,079 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:29:28,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:29:28 BoogieIcfgContainer [2022-04-27 20:29:28,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:29:28,081 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:29:28,081 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:29:28,082 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:29:28,084 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:29:28" (1/1) ... [2022-04-27 20:29:28,085 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:29:28,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:29:28 BasicIcfg [2022-04-27 20:29:28,109 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:29:28,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:29:28,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:29:28,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:29:28,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:29:27" (1/4) ... [2022-04-27 20:29:28,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:29:28, skipping insertion in model container [2022-04-27 20:29:28,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:29:27" (2/4) ... [2022-04-27 20:29:28,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:29:28, skipping insertion in model container [2022-04-27 20:29:28,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:29:28" (3/4) ... [2022-04-27 20:29:28,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d4632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:29:28, skipping insertion in model container [2022-04-27 20:29:28,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:29:28" (4/4) ... [2022-04-27 20:29:28,115 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.cJordan [2022-04-27 20:29:28,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:29:28,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:29:28,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:29:28,165 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5574fb6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44389d64 [2022-04-27 20:29:28,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:29:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:29:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 20:29:28,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:28,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:28,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1823990193, now seen corresponding path program 1 times [2022-04-27 20:29:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619824789] [2022-04-27 20:29:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:28,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {54#true} is VALID [2022-04-27 20:29:28,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-27 20:29:28,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-27 20:29:28,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:28,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {54#true} is VALID [2022-04-27 20:29:28,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-27 20:29:28,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-27 20:29:28,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-27 20:29:28,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {54#true} is VALID [2022-04-27 20:29:28,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {54#true} is VALID [2022-04-27 20:29:28,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {54#true} is VALID [2022-04-27 20:29:28,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} [250] L78-->L78-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} [252] L78-2-->L82-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} [274] L122-1-->L129: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {59#(= main_~lk1~0 1)} is VALID [2022-04-27 20:29:28,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} [276] L129-->L184-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-27 20:29:28,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-27 20:29:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:28,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619824789] [2022-04-27 20:29:28,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619824789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:28,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:28,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185032942] [2022-04-27 20:29:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 20:29:28,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:28,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:28,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:28,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:28,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:28,459 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:28,769 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2022-04-27 20:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:28,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 20:29:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 20:29:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 20:29:28,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-27 20:29:28,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:28,951 INFO L225 Difference]: With dead ends: 93 [2022-04-27 20:29:28,951 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 20:29:28,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:28,954 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:28,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:29:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 20:29:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-27 20:29:28,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:28,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,985 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,987 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:28,995 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-27 20:29:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-27 20:29:28,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:28,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:28,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 20:29:28,997 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 20:29:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,009 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-27 20:29:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-27 20:29:29,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:29,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:29,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:29,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-27 20:29:29,021 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-27 20:29:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-27 20:29:29,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-27 20:29:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 20:29:29,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:29,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:29,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:29:29,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -316438384, now seen corresponding path program 1 times [2022-04-27 20:29:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830060709] [2022-04-27 20:29:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:29,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {388#true} is VALID [2022-04-27 20:29:29,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-27 20:29:29,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-27 20:29:29,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {388#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:29,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {388#true} is VALID [2022-04-27 20:29:29,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {388#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-27 20:29:29,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-27 20:29:29,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {388#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-27 20:29:29,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {388#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {388#true} is VALID [2022-04-27 20:29:29,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {388#true} is VALID [2022-04-27 20:29:29,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {388#true} is VALID [2022-04-27 20:29:29,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#(= main_~p1~0 0)} [252] L78-2-->L82-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(= main_~p1~0 0)} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(= main_~p1~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {393#(= main_~p1~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(= main_~p1~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {393#(= main_~p1~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {393#(= main_~p1~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {393#(= main_~p1~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#(= main_~p1~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#(= main_~p1~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {393#(= main_~p1~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {393#(= main_~p1~0 0)} is VALID [2022-04-27 20:29:29,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {393#(= main_~p1~0 0)} [274] L122-1-->L129: Formula: (not (= v_main_~p1~0_4 0)) InVars {main_~p1~0=v_main_~p1~0_4} OutVars{main_~p1~0=v_main_~p1~0_4} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-27 20:29:29,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {389#false} [276] L129-->L184-1: Formula: (not (= v_main_~lk1~0_4 1)) InVars {main_~lk1~0=v_main_~lk1~0_4} OutVars{main_~lk1~0=v_main_~lk1~0_4} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-27 20:29:29,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {389#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-27 20:29:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:29,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830060709] [2022-04-27 20:29:29,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830060709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:29,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:29,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758026244] [2022-04-27 20:29:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 20:29:29,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:29,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:29,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:29,169 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,374 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-27 20:29:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 20:29:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-27 20:29:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-27 20:29:29,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-27 20:29:29,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:29,502 INFO L225 Difference]: With dead ends: 85 [2022-04-27 20:29:29,503 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 20:29:29,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:29,505 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:29,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:29:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 20:29:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-27 20:29:29,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:29,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,518 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,519 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,524 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-27 20:29:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-27 20:29:29,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:29,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:29,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 20:29:29,525 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 20:29:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,528 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-27 20:29:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-27 20:29:29,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:29,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:29,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:29,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-27 20:29:29,531 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-27 20:29:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:29,532 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-27 20:29:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-27 20:29:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:29:29,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:29,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 20:29:29,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -709089080, now seen corresponding path program 1 times [2022-04-27 20:29:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:29,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095177965] [2022-04-27 20:29:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:29,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-27 20:29:29,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-27 20:29:29,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-27 20:29:29,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:29,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-27 20:29:29,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-27 20:29:29,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-27 20:29:29,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-27 20:29:29,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {738#true} is VALID [2022-04-27 20:29:29,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {738#true} is VALID [2022-04-27 20:29:29,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {738#true} is VALID [2022-04-27 20:29:29,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#true} [250] L78-->L78-2: Formula: (and (= v_main_~lk1~0_3 1) (not (= v_main_~p1~0_2 0))) InVars {main_~p1~0=v_main_~p1~0_2} OutVars{main_~p1~0=v_main_~p1~0_2, main_~lk1~0=v_main_~lk1~0_3} AuxVars[] AssignedVars[main_~lk1~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {743#(not (= main_~p1~0 0))} [252] L78-2-->L82-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {743#(not (= main_~p1~0 0))} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {743#(not (= main_~p1~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {743#(not (= main_~p1~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {743#(not (= main_~p1~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= main_~p1~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {743#(not (= main_~p1~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {743#(not (= main_~p1~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {743#(not (= main_~p1~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {743#(not (= main_~p1~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {743#(not (= main_~p1~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {743#(not (= main_~p1~0 0))} is VALID [2022-04-27 20:29:29,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {743#(not (= main_~p1~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-27 20:29:29,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {739#false} [278] L128-1-->L134: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-27 20:29:29,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#false} [282] L134-->L184-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-27 20:29:29,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {739#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-27 20:29:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:29,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:29,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095177965] [2022-04-27 20:29:29,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095177965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:29,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:29,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274614992] [2022-04-27 20:29:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:29,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:29,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:29,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:29,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:29,619 INFO L87 Difference]: Start difference. First operand 83 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,772 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 20:29:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-27 20:29:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-27 20:29:29,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 152 transitions. [2022-04-27 20:29:29,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:29,929 INFO L225 Difference]: With dead ends: 88 [2022-04-27 20:29:29,929 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 20:29:29,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:29,930 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:29,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 20:29:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-27 20:29:29,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:29,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,934 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,934 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,936 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 20:29:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-27 20:29:29,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:29,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:29,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 20:29:29,937 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-27 20:29:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:29,939 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-27 20:29:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-27 20:29:29,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:29,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:29,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:29,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-27 20:29:29,942 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-27 20:29:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:29,942 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-27 20:29:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-27 20:29:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:29:29,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:29,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:29,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 20:29:29,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1219623257, now seen corresponding path program 1 times [2022-04-27 20:29:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195905839] [2022-04-27 20:29:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:30,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1100#true} is VALID [2022-04-27 20:29:30,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:30,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1100#true} is VALID [2022-04-27 20:29:30,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1100#true} is VALID [2022-04-27 20:29:30,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1100#true} is VALID [2022-04-27 20:29:30,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1100#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1100#true} is VALID [2022-04-27 20:29:30,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {1100#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-27 20:29:30,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1100#true} [252] L78-2-->L82-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#(= main_~lk2~0 1)} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {1105#(= main_~lk2~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#(= main_~lk2~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1105#(= main_~lk2~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1105#(= main_~lk2~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1105#(= main_~lk2~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1105#(= main_~lk2~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1105#(= main_~lk2~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1105#(= main_~lk2~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {1105#(= main_~lk2~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {1105#(= main_~lk2~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {1105#(= main_~lk2~0 1)} [278] L128-1-->L134: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1105#(= main_~lk2~0 1)} is VALID [2022-04-27 20:29:30,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {1105#(= main_~lk2~0 1)} [282] L134-->L184-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1101#false} is VALID [2022-04-27 20:29:30,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {1101#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1101#false} is VALID [2022-04-27 20:29:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195905839] [2022-04-27 20:29:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195905839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:30,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:30,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:30,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786403412] [2022-04-27 20:29:30,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:30,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:30,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:30,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:30,029 INFO L87 Difference]: Start difference. First operand 86 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,198 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-27 20:29:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 20:29:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 20:29:30,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-27 20:29:30,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:30,299 INFO L225 Difference]: With dead ends: 159 [2022-04-27 20:29:30,299 INFO L226 Difference]: Without dead ends: 159 [2022-04-27 20:29:30,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:30,300 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:30,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-27 20:29:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2022-04-27 20:29:30,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:30,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,305 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,305 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,310 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-27 20:29:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-27 20:29:30,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:30,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:30,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-27 20:29:30,311 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-27 20:29:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,316 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-27 20:29:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-27 20:29:30,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:30,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:30,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:30,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.81651376146789) internal successors, (198), 109 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 201 transitions. [2022-04-27 20:29:30,319 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 201 transitions. Word has length 24 [2022-04-27 20:29:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:30,320 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 201 transitions. [2022-04-27 20:29:30,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 201 transitions. [2022-04-27 20:29:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 20:29:30,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:30,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:30,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 20:29:30,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 287928552, now seen corresponding path program 1 times [2022-04-27 20:29:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:30,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225518130] [2022-04-27 20:29:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:30,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1702#true} is VALID [2022-04-27 20:29:30,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1702#true} {1702#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {1702#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:30,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1702#true} is VALID [2022-04-27 20:29:30,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1702#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {1702#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1702#true} is VALID [2022-04-27 20:29:30,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {1702#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {1702#true} is VALID [2022-04-27 20:29:30,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {1702#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1702#true} is VALID [2022-04-27 20:29:30,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {1702#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-27 20:29:30,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {1702#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {1707#(= main_~p2~0 0)} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {1707#(= main_~p2~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {1707#(= main_~p2~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {1707#(= main_~p2~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {1707#(= main_~p2~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {1707#(= main_~p2~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {1707#(= main_~p2~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {1707#(= main_~p2~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {1707#(= main_~p2~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {1707#(= main_~p2~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {1707#(= main_~p2~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {1707#(= main_~p2~0 0)} is VALID [2022-04-27 20:29:30,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {1707#(= main_~p2~0 0)} [278] L128-1-->L134: Formula: (not (= v_main_~p2~0_4 0)) InVars {main_~p2~0=v_main_~p2~0_4} OutVars{main_~p2~0=v_main_~p2~0_4} AuxVars[] AssignedVars[] {1703#false} is VALID [2022-04-27 20:29:30,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {1703#false} [282] L134-->L184-1: Formula: (not (= v_main_~lk2~0_4 1)) InVars {main_~lk2~0=v_main_~lk2~0_4} OutVars{main_~lk2~0=v_main_~lk2~0_4} AuxVars[] AssignedVars[] {1703#false} is VALID [2022-04-27 20:29:30,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {1703#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1703#false} is VALID [2022-04-27 20:29:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225518130] [2022-04-27 20:29:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225518130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:30,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:30,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:30,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978343971] [2022-04-27 20:29:30,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:30,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:30,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:30,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:30,410 INFO L87 Difference]: Start difference. First operand 113 states and 201 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,555 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-27 20:29:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:30,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 20:29:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 20:29:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 20:29:30,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 20:29:30,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:30,659 INFO L225 Difference]: With dead ends: 161 [2022-04-27 20:29:30,659 INFO L226 Difference]: Without dead ends: 161 [2022-04-27 20:29:30,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:30,662 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:30,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 113 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-27 20:29:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-27 20:29:30,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:30,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,678 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,678 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,681 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-27 20:29:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-27 20:29:30,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:30,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:30,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-27 20:29:30,682 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-27 20:29:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,685 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-27 20:29:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-27 20:29:30,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:30,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:30,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:30,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-27 20:29:30,691 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-27 20:29:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:30,692 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-27 20:29:30,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-27 20:29:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:29:30,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:30,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:30,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 20:29:30,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 846416876, now seen corresponding path program 1 times [2022-04-27 20:29:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:30,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185782713] [2022-04-27 20:29:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:30,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2356#true} is VALID [2022-04-27 20:29:30,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2356#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2356#true} {2356#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {2356#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:30,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2356#true} is VALID [2022-04-27 20:29:30,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {2356#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2356#true} {2356#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {2356#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2356#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2356#true} is VALID [2022-04-27 20:29:30,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {2356#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {2356#true} is VALID [2022-04-27 20:29:30,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {2356#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2356#true} is VALID [2022-04-27 20:29:30,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {2356#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-27 20:29:30,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {2356#true} [252] L78-2-->L82-1: Formula: (and (= v_main_~lk2~0_3 1) (not (= v_main_~p2~0_2 0))) InVars {main_~p2~0=v_main_~p2~0_2} OutVars{main_~lk2~0=v_main_~lk2~0_3, main_~p2~0=v_main_~p2~0_2} AuxVars[] AssignedVars[main_~lk2~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(not (= main_~p2~0 0))} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2361#(not (= main_~p2~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2361#(not (= main_~p2~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2361#(not (= main_~p2~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(not (= main_~p2~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2361#(not (= main_~p2~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {2361#(not (= main_~p2~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {2361#(not (= main_~p2~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#(not (= main_~p2~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#(not (= main_~p2~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#(not (= main_~p2~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {2361#(not (= main_~p2~0 0))} is VALID [2022-04-27 20:29:30,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {2361#(not (= main_~p2~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {2357#false} is VALID [2022-04-27 20:29:30,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {2357#false} [284] L133-1-->L139: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2357#false} is VALID [2022-04-27 20:29:30,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {2357#false} [286] L139-->L184-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2357#false} is VALID [2022-04-27 20:29:30,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {2357#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2357#false} is VALID [2022-04-27 20:29:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:30,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185782713] [2022-04-27 20:29:30,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185782713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:30,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:30,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719463628] [2022-04-27 20:29:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:30,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:30,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:30,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:30,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:30,779 INFO L87 Difference]: Start difference. First operand 159 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:30,939 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-27 20:29:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 20:29:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 20:29:30,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-27 20:29:31,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,043 INFO L225 Difference]: With dead ends: 163 [2022-04-27 20:29:31,043 INFO L226 Difference]: Without dead ends: 163 [2022-04-27 20:29:31,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:31,044 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 156 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:31,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 130 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-27 20:29:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-27 20:29:31,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:31,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,048 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,048 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,051 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-27 20:29:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-27 20:29:31,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-27 20:29:31,052 INFO L87 Difference]: Start difference. First operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-27 20:29:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,055 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-27 20:29:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-27 20:29:31,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:31,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 157 states have (on average 1.78343949044586) internal successors, (280), 157 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 283 transitions. [2022-04-27 20:29:31,059 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 283 transitions. Word has length 25 [2022-04-27 20:29:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:31,059 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 283 transitions. [2022-04-27 20:29:31,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 283 transitions. [2022-04-27 20:29:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:29:31,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:31,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:31,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 20:29:31,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 335882699, now seen corresponding path program 1 times [2022-04-27 20:29:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:31,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853701598] [2022-04-27 20:29:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3018#true} is VALID [2022-04-27 20:29:31,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3018#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3018#true} {3018#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {3018#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:31,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3018#true} is VALID [2022-04-27 20:29:31,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {3018#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3018#true} {3018#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {3018#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {3018#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3018#true} is VALID [2022-04-27 20:29:31,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {3018#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {3018#true} is VALID [2022-04-27 20:29:31,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3018#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3018#true} is VALID [2022-04-27 20:29:31,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3018#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3018#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-27 20:29:31,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#true} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3023#(= main_~lk3~0 1)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {3023#(= main_~lk3~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {3023#(= main_~lk3~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {3023#(= main_~lk3~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {3023#(= main_~lk3~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {3023#(= main_~lk3~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {3023#(= main_~lk3~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {3023#(= main_~lk3~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {3023#(= main_~lk3~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {3023#(= main_~lk3~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {3023#(= main_~lk3~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {3023#(= main_~lk3~0 1)} [284] L133-1-->L139: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {3023#(= main_~lk3~0 1)} is VALID [2022-04-27 20:29:31,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {3023#(= main_~lk3~0 1)} [286] L139-->L184-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3019#false} is VALID [2022-04-27 20:29:31,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {3019#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3019#false} is VALID [2022-04-27 20:29:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:31,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853701598] [2022-04-27 20:29:31,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853701598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:31,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:31,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181439863] [2022-04-27 20:29:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:31,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:31,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:31,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:31,114 INFO L87 Difference]: Start difference. First operand 161 states and 283 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,292 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-27 20:29:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:31,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-27 20:29:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-27 20:29:31,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-27 20:29:31,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,409 INFO L225 Difference]: With dead ends: 299 [2022-04-27 20:29:31,409 INFO L226 Difference]: Without dead ends: 299 [2022-04-27 20:29:31,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:31,423 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:31,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-27 20:29:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2022-04-27 20:29:31,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:31,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,428 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,428 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,434 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-27 20:29:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-27 20:29:31,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 20:29:31,436 INFO L87 Difference]: Start difference. First operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 20:29:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,442 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-27 20:29:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-27 20:29:31,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:31,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 213 states have (on average 1.7652582159624413) internal successors, (376), 213 states have internal predecessors, (376), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 379 transitions. [2022-04-27 20:29:31,446 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 379 transitions. Word has length 25 [2022-04-27 20:29:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:31,446 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 379 transitions. [2022-04-27 20:29:31,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 379 transitions. [2022-04-27 20:29:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 20:29:31,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:31,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:31,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 20:29:31,447 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434508, now seen corresponding path program 1 times [2022-04-27 20:29:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:31,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430285144] [2022-04-27 20:29:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {4150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4144#true} is VALID [2022-04-27 20:29:31,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {4144#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4144#true} {4144#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {4144#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:31,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {4150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4144#true} is VALID [2022-04-27 20:29:31,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {4144#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4144#true} {4144#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {4144#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {4144#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {4144#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {4144#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {4144#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {4144#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-27 20:29:31,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {4144#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {4149#(= main_~p3~0 0)} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {4149#(= main_~p3~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {4149#(= main_~p3~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {4149#(= main_~p3~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {4149#(= main_~p3~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {4149#(= main_~p3~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {4149#(= main_~p3~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {4149#(= main_~p3~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {4149#(= main_~p3~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {4149#(= main_~p3~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {4149#(= main_~p3~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {4149#(= main_~p3~0 0)} is VALID [2022-04-27 20:29:31,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {4149#(= main_~p3~0 0)} [284] L133-1-->L139: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {4145#false} is VALID [2022-04-27 20:29:31,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {4145#false} [286] L139-->L184-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {4145#false} is VALID [2022-04-27 20:29:31,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {4145#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4145#false} is VALID [2022-04-27 20:29:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430285144] [2022-04-27 20:29:31,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430285144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:31,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477537258] [2022-04-27 20:29:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:31,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:31,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:31,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:31,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:31,515 INFO L87 Difference]: Start difference. First operand 217 states and 379 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,688 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-27 20:29:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 20:29:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-27 20:29:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-27 20:29:31,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 149 transitions. [2022-04-27 20:29:31,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,789 INFO L225 Difference]: With dead ends: 307 [2022-04-27 20:29:31,789 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 20:29:31,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:31,790 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:31,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 20:29:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-27 20:29:31,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:31,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,795 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,796 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,801 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-27 20:29:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-27 20:29:31,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-27 20:29:31,802 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-27 20:29:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:31,808 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-27 20:29:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-27 20:29:31,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:31,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:31,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:31,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.7541528239202657) internal successors, (528), 301 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 531 transitions. [2022-04-27 20:29:31,814 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 531 transitions. Word has length 25 [2022-04-27 20:29:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:31,814 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 531 transitions. [2022-04-27 20:29:31,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 531 transitions. [2022-04-27 20:29:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:29:31,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:31,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:31,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 20:29:31,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1822461380, now seen corresponding path program 1 times [2022-04-27 20:29:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:31,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538571428] [2022-04-27 20:29:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:31,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:31,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {5388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5382#true} is VALID [2022-04-27 20:29:31,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {5382#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5382#true} {5382#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {5382#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:31,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {5388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5382#true} is VALID [2022-04-27 20:29:31,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {5382#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5382#true} {5382#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {5382#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {5382#true} is VALID [2022-04-27 20:29:31,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {5382#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {5382#true} is VALID [2022-04-27 20:29:31,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {5382#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {5382#true} is VALID [2022-04-27 20:29:31,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {5382#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {5382#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-27 20:29:31,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {5382#true} [254] L82-1-->L86-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {5387#(not (= main_~p3~0 0))} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {5387#(not (= main_~p3~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {5387#(not (= main_~p3~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {5387#(not (= main_~p3~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {5387#(not (= main_~p3~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {5387#(not (= main_~p3~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {5387#(not (= main_~p3~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {5387#(not (= main_~p3~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {5387#(not (= main_~p3~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {5387#(not (= main_~p3~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {5387#(not (= main_~p3~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {5387#(not (= main_~p3~0 0))} is VALID [2022-04-27 20:29:31,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {5387#(not (= main_~p3~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {5383#false} is VALID [2022-04-27 20:29:31,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {5383#false} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {5383#false} is VALID [2022-04-27 20:29:31,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {5383#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {5383#false} is VALID [2022-04-27 20:29:31,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5383#false} is VALID [2022-04-27 20:29:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538571428] [2022-04-27 20:29:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538571428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:31,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296405821] [2022-04-27 20:29:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:31,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:31,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:31,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:31,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:31,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:31,879 INFO L87 Difference]: Start difference. First operand 305 states and 531 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,056 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-27 20:29:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 20:29:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-27 20:29:32,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-27 20:29:32,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:32,155 INFO L225 Difference]: With dead ends: 311 [2022-04-27 20:29:32,155 INFO L226 Difference]: Without dead ends: 311 [2022-04-27 20:29:32,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:32,156 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:32,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-27 20:29:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-27 20:29:32,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:32,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,183 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,183 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,189 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-27 20:29:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-27 20:29:32,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:32,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:32,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-27 20:29:32,192 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 311 states. [2022-04-27 20:29:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,203 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-27 20:29:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-27 20:29:32,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:32,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:32,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:32,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7311475409836066) internal successors, (528), 305 states have internal predecessors, (528), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 531 transitions. [2022-04-27 20:29:32,210 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 531 transitions. Word has length 26 [2022-04-27 20:29:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:32,210 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 531 transitions. [2022-04-27 20:29:32,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 531 transitions. [2022-04-27 20:29:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:29:32,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:32,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 20:29:32,215 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1311927203, now seen corresponding path program 1 times [2022-04-27 20:29:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750276210] [2022-04-27 20:29:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:32,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {6642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6636#true} is VALID [2022-04-27 20:29:32,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {6636#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6636#true} {6636#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {6636#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6636#true} is VALID [2022-04-27 20:29:32,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {6636#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6636#true} {6636#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {6636#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {6636#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6636#true} is VALID [2022-04-27 20:29:32,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {6636#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {6636#true} is VALID [2022-04-27 20:29:32,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {6636#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6636#true} is VALID [2022-04-27 20:29:32,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {6636#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {6636#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {6636#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-27 20:29:32,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {6636#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {6641#(= main_~lk4~0 1)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {6641#(= main_~lk4~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {6641#(= main_~lk4~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {6641#(= main_~lk4~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {6641#(= main_~lk4~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {6641#(= main_~lk4~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {6641#(= main_~lk4~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {6641#(= main_~lk4~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {6641#(= main_~lk4~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {6641#(= main_~lk4~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {6641#(= main_~lk4~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {6641#(= main_~lk4~0 1)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {6641#(= main_~lk4~0 1)} is VALID [2022-04-27 20:29:32,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {6641#(= main_~lk4~0 1)} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {6637#false} is VALID [2022-04-27 20:29:32,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {6637#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6637#false} is VALID [2022-04-27 20:29:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750276210] [2022-04-27 20:29:32,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750276210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:32,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:32,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106415485] [2022-04-27 20:29:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:32,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:32,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:32,300 INFO L87 Difference]: Start difference. First operand 309 states and 531 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,454 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-27 20:29:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:32,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 20:29:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 20:29:32,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-27 20:29:32,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:32,567 INFO L225 Difference]: With dead ends: 571 [2022-04-27 20:29:32,567 INFO L226 Difference]: Without dead ends: 571 [2022-04-27 20:29:32,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:32,569 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:32,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-27 20:29:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-27 20:29:32,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:32,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,578 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,579 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,591 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-27 20:29:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-27 20:29:32,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:32,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:32,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-27 20:29:32,594 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-27 20:29:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,607 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-27 20:29:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-27 20:29:32,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:32,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:32,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:32,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.700712589073634) internal successors, (716), 421 states have internal predecessors, (716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 719 transitions. [2022-04-27 20:29:32,617 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 719 transitions. Word has length 26 [2022-04-27 20:29:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:32,617 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 719 transitions. [2022-04-27 20:29:32,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 719 transitions. [2022-04-27 20:29:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:29:32,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:32,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:32,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 20:29:32,619 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1475488284, now seen corresponding path program 1 times [2022-04-27 20:29:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:32,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924086505] [2022-04-27 20:29:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:32,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {8792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8786#true} is VALID [2022-04-27 20:29:32,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {8786#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8786#true} {8786#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {8786#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:32,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {8792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {8786#true} is VALID [2022-04-27 20:29:32,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {8786#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8786#true} {8786#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {8786#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {8786#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {8786#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {8786#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {8786#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {8786#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-27 20:29:32,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {8786#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {8791#(= main_~p4~0 0)} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {8791#(= main_~p4~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8791#(= main_~p4~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {8791#(= main_~p4~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {8791#(= main_~p4~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(= main_~p4~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(= main_~p4~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {8791#(= main_~p4~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {8791#(= main_~p4~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {8791#(= main_~p4~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {8791#(= main_~p4~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {8791#(= main_~p4~0 0)} is VALID [2022-04-27 20:29:32,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {8791#(= main_~p4~0 0)} [288] L138-1-->L144: Formula: (not (= v_main_~p4~0_1 0)) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {8787#false} is VALID [2022-04-27 20:29:32,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {8787#false} [290] L144-->L184-1: Formula: (not (= v_main_~lk4~0_1 1)) InVars {main_~lk4~0=v_main_~lk4~0_1} OutVars{main_~lk4~0=v_main_~lk4~0_1} AuxVars[] AssignedVars[] {8787#false} is VALID [2022-04-27 20:29:32,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {8787#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8787#false} is VALID [2022-04-27 20:29:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:32,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924086505] [2022-04-27 20:29:32,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924086505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:32,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:32,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:32,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355857099] [2022-04-27 20:29:32,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:32,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:32,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:32,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:32,702 INFO L87 Difference]: Start difference. First operand 425 states and 719 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:32,881 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-27 20:29:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 20:29:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 20:29:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 20:29:32,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-27 20:29:32,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:32,982 INFO L225 Difference]: With dead ends: 595 [2022-04-27 20:29:32,982 INFO L226 Difference]: Without dead ends: 595 [2022-04-27 20:29:32,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:32,983 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:32,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-27 20:29:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-27 20:29:32,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:32,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,991 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:32,992 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,004 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-27 20:29:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-27 20:29:33,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states. [2022-04-27 20:29:33,007 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 595 states. [2022-04-27 20:29:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,020 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-27 20:29:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-27 20:29:33,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:33,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.6910016977928692) internal successors, (996), 589 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 999 transitions. [2022-04-27 20:29:33,034 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 999 transitions. Word has length 26 [2022-04-27 20:29:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:33,034 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 999 transitions. [2022-04-27 20:29:33,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 999 transitions. [2022-04-27 20:29:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 20:29:33,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:33,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:33,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 20:29:33,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2015070056, now seen corresponding path program 1 times [2022-04-27 20:29:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:33,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143077916] [2022-04-27 20:29:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {11182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {11176#true} is VALID [2022-04-27 20:29:33,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {11176#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11176#true} {11176#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {11176#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:33,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {11182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {11176#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11176#true} {11176#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {11176#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {11176#true} is VALID [2022-04-27 20:29:33,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {11176#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {11176#true} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {11176#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {11176#true} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {11176#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {11176#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {11176#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {11176#true} [256] L86-1-->L90-1: Formula: (and (not (= v_main_~p4~0_4 0)) (= v_main_~lk4~0_6 1)) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4, main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[main_~lk4~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {11181#(not (= main_~p4~0 0))} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {11181#(not (= main_~p4~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {11181#(not (= main_~p4~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {11181#(not (= main_~p4~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {11181#(not (= main_~p4~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {11181#(not (= main_~p4~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {11181#(not (= main_~p4~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {11181#(not (= main_~p4~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {11181#(not (= main_~p4~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {11181#(not (= main_~p4~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {11181#(not (= main_~p4~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {11181#(not (= main_~p4~0 0))} is VALID [2022-04-27 20:29:33,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {11181#(not (= main_~p4~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {11177#false} is VALID [2022-04-27 20:29:33,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {11177#false} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {11177#false} is VALID [2022-04-27 20:29:33,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {11177#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {11177#false} is VALID [2022-04-27 20:29:33,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {11177#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11177#false} is VALID [2022-04-27 20:29:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:33,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143077916] [2022-04-27 20:29:33,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143077916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:33,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912209945] [2022-04-27 20:29:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:33,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:33,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:33,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:33,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:33,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:33,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:33,083 INFO L87 Difference]: Start difference. First operand 593 states and 999 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,242 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-27 20:29:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-27 20:29:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-27 20:29:33,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-27 20:29:33,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:33,343 INFO L225 Difference]: With dead ends: 603 [2022-04-27 20:29:33,343 INFO L226 Difference]: Without dead ends: 603 [2022-04-27 20:29:33,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:33,344 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:33,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-27 20:29:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-27 20:29:33,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:33,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,352 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,353 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,365 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-27 20:29:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-27 20:29:33,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 20:29:33,368 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 20:29:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,381 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-27 20:29:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-27 20:29:33,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:33,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.6683417085427135) internal successors, (996), 597 states have internal predecessors, (996), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 999 transitions. [2022-04-27 20:29:33,395 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 999 transitions. Word has length 27 [2022-04-27 20:29:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:33,395 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 999 transitions. [2022-04-27 20:29:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 999 transitions. [2022-04-27 20:29:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 20:29:33,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:33,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:33,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 20:29:33,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1504535879, now seen corresponding path program 1 times [2022-04-27 20:29:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:33,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687214833] [2022-04-27 20:29:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {13604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13598#true} is VALID [2022-04-27 20:29:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {13598#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13598#true} {13598#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {13598#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {13604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {13598#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13598#true} {13598#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {13598#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {13598#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {13598#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {13598#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {13598#true} is VALID [2022-04-27 20:29:33,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {13598#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {13598#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {13598#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {13598#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {13598#true} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {13603#(= main_~lk5~0 1)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {13603#(= main_~lk5~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {13603#(= main_~lk5~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {13603#(= main_~lk5~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {13603#(= main_~lk5~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {13603#(= main_~lk5~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {13603#(= main_~lk5~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {13603#(= main_~lk5~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {13603#(= main_~lk5~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {13603#(= main_~lk5~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {13603#(= main_~lk5~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {13603#(= main_~lk5~0 1)} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {13603#(= main_~lk5~0 1)} is VALID [2022-04-27 20:29:33,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {13603#(= main_~lk5~0 1)} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {13599#false} is VALID [2022-04-27 20:29:33,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {13599#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13599#false} is VALID [2022-04-27 20:29:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:33,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:33,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687214833] [2022-04-27 20:29:33,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687214833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:33,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:33,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605334898] [2022-04-27 20:29:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:33,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:33,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:33,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:33,444 INFO L87 Difference]: Start difference. First operand 601 states and 999 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,621 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-27 20:29:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:33,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 20:29:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 20:29:33,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-27 20:29:33,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:33,739 INFO L225 Difference]: With dead ends: 1099 [2022-04-27 20:29:33,739 INFO L226 Difference]: Without dead ends: 1099 [2022-04-27 20:29:33,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:33,740 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:33,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-27 20:29:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-27 20:29:33,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:33,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,753 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,754 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,788 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-27 20:29:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-27 20:29:33,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states. [2022-04-27 20:29:33,792 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1099 states. [2022-04-27 20:29:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:33,827 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-27 20:29:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-27 20:29:33,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:33,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:33,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:33,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6296296296296295) internal successors, (1364), 837 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1367 transitions. [2022-04-27 20:29:33,883 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1367 transitions. Word has length 27 [2022-04-27 20:29:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:33,883 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1367 transitions. [2022-04-27 20:29:33,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1367 transitions. [2022-04-27 20:29:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 20:29:33,885 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:33,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:33,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 20:29:33,885 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1282879608, now seen corresponding path program 1 times [2022-04-27 20:29:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:33,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878569412] [2022-04-27 20:29:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:33,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {17754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17748#true} is VALID [2022-04-27 20:29:33,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {17748#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17748#true} {17748#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {17748#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:33,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {17754#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {17748#true} is VALID [2022-04-27 20:29:33,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {17748#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17748#true} {17748#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {17748#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {17748#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {17748#true} is VALID [2022-04-27 20:29:33,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {17748#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {17748#true} is VALID [2022-04-27 20:29:33,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {17748#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {17748#true} is VALID [2022-04-27 20:29:33,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {17748#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {17748#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {17748#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {17748#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-27 20:29:33,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {17748#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {17753#(= main_~p5~0 0)} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {17753#(= main_~p5~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {17753#(= main_~p5~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {17753#(= main_~p5~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {17753#(= main_~p5~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {17753#(= main_~p5~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {17753#(= main_~p5~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {17753#(= main_~p5~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {17753#(= main_~p5~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {17753#(= main_~p5~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {17753#(= main_~p5~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {17753#(= main_~p5~0 0)} is VALID [2022-04-27 20:29:33,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {17753#(= main_~p5~0 0)} [292] L143-1-->L149: Formula: (not (= v_main_~p5~0_2 0)) InVars {main_~p5~0=v_main_~p5~0_2} OutVars{main_~p5~0=v_main_~p5~0_2} AuxVars[] AssignedVars[] {17749#false} is VALID [2022-04-27 20:29:33,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {17749#false} [294] L149-->L184-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {17749#false} is VALID [2022-04-27 20:29:33,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {17749#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17749#false} is VALID [2022-04-27 20:29:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:33,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878569412] [2022-04-27 20:29:33,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878569412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:33,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:33,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704001478] [2022-04-27 20:29:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:33,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:33,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:33,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:33,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:33,959 INFO L87 Difference]: Start difference. First operand 841 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,129 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-27 20:29:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 20:29:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-27 20:29:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-27 20:29:34,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-27 20:29:34,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:34,259 INFO L225 Difference]: With dead ends: 1163 [2022-04-27 20:29:34,259 INFO L226 Difference]: Without dead ends: 1163 [2022-04-27 20:29:34,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:34,260 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:34,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-27 20:29:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-27 20:29:34,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:34,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,279 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,281 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,318 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-27 20:29:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-27 20:29:34,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:34,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:34,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-27 20:29:34,323 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-27 20:29:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,360 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-27 20:29:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-27 20:29:34,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:34,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:34,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:34,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6214347450302506) internal successors, (1876), 1157 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1879 transitions. [2022-04-27 20:29:34,401 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1879 transitions. Word has length 27 [2022-04-27 20:29:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:34,401 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1879 transitions. [2022-04-27 20:29:34,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1879 transitions. [2022-04-27 20:29:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 20:29:34,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:34,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 20:29:34,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash -603995456, now seen corresponding path program 1 times [2022-04-27 20:29:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:34,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484750418] [2022-04-27 20:29:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:34,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {22416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22410#true} is VALID [2022-04-27 20:29:34,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {22410#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22410#true} {22410#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {22410#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:34,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {22416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {22410#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22410#true} {22410#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {22410#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {22410#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {22410#true} is VALID [2022-04-27 20:29:34,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {22410#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {22410#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {22410#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {22410#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {22410#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {22410#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {22410#true} [258] L90-1-->L94-1: Formula: (and (= v_main_~lk5~0_6 1) (not (= v_main_~p5~0_4 0))) InVars {main_~p5~0=v_main_~p5~0_4} OutVars{main_~p5~0=v_main_~p5~0_4, main_~lk5~0=v_main_~lk5~0_6} AuxVars[] AssignedVars[main_~lk5~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {22415#(not (= main_~p5~0 0))} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {22415#(not (= main_~p5~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {22415#(not (= main_~p5~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {22415#(not (= main_~p5~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {22415#(not (= main_~p5~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {22415#(not (= main_~p5~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {22415#(not (= main_~p5~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {22415#(not (= main_~p5~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {22415#(not (= main_~p5~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {22415#(not (= main_~p5~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {22415#(not (= main_~p5~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {22415#(not (= main_~p5~0 0))} is VALID [2022-04-27 20:29:34,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {22415#(not (= main_~p5~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {22411#false} is VALID [2022-04-27 20:29:34,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {22411#false} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {22411#false} is VALID [2022-04-27 20:29:34,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {22411#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {22411#false} is VALID [2022-04-27 20:29:34,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {22411#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22411#false} is VALID [2022-04-27 20:29:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484750418] [2022-04-27 20:29:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484750418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:34,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:34,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456203228] [2022-04-27 20:29:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:34,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:34,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:34,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:34,466 INFO L87 Difference]: Start difference. First operand 1161 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,678 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-27 20:29:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 20:29:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 20:29:34,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-27 20:29:34,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:34,823 INFO L225 Difference]: With dead ends: 1179 [2022-04-27 20:29:34,823 INFO L226 Difference]: Without dead ends: 1179 [2022-04-27 20:29:34,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:34,825 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:34,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-27 20:29:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-27 20:29:34,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:34,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,842 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,844 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,880 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-27 20:29:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-27 20:29:34,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:34,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:34,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states. [2022-04-27 20:29:34,885 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1179 states. [2022-04-27 20:29:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:34,921 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-27 20:29:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-27 20:29:34,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:34,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:34,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:34,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.5993179880647912) internal successors, (1876), 1173 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1879 transitions. [2022-04-27 20:29:34,961 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1879 transitions. Word has length 28 [2022-04-27 20:29:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:34,962 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1879 transitions. [2022-04-27 20:29:34,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1879 transitions. [2022-04-27 20:29:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 20:29:34,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:34,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:34,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 20:29:34,963 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1114529633, now seen corresponding path program 1 times [2022-04-27 20:29:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:34,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233427695] [2022-04-27 20:29:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:35,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {27142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27136#true} is VALID [2022-04-27 20:29:35,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {27136#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27136#true} {27136#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {27136#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:35,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {27142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27136#true} is VALID [2022-04-27 20:29:35,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {27136#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27136#true} {27136#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {27136#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {27136#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {27136#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {27136#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {27136#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {27136#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {27136#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {27136#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {27136#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-27 20:29:35,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {27136#true} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {27141#(= main_~lk6~0 1)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {27141#(= main_~lk6~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {27141#(= main_~lk6~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {27141#(= main_~lk6~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {27141#(= main_~lk6~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {27141#(= main_~lk6~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {27141#(= main_~lk6~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {27141#(= main_~lk6~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {27141#(= main_~lk6~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {27141#(= main_~lk6~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {27141#(= main_~lk6~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {27141#(= main_~lk6~0 1)} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {27141#(= main_~lk6~0 1)} is VALID [2022-04-27 20:29:35,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {27141#(= main_~lk6~0 1)} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {27137#false} is VALID [2022-04-27 20:29:35,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {27137#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27137#false} is VALID [2022-04-27 20:29:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:35,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233427695] [2022-04-27 20:29:35,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233427695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:35,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:35,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772457716] [2022-04-27 20:29:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:35,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:35,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:35,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:35,024 INFO L87 Difference]: Start difference. First operand 1177 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:35,277 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-27 20:29:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-27 20:29:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-27 20:29:35,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-27 20:29:35,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:35,484 INFO L225 Difference]: With dead ends: 2123 [2022-04-27 20:29:35,485 INFO L226 Difference]: Without dead ends: 2123 [2022-04-27 20:29:35,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:35,485 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:35,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-27 20:29:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-27 20:29:35,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:35,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,506 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,507 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:35,615 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-27 20:29:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-27 20:29:35,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:35,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:35,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-27 20:29:35,621 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-27 20:29:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:35,728 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-27 20:29:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-27 20:29:35,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:35,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:35,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:35,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.555422408627921) internal successors, (2596), 1669 states have internal predecessors, (2596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2599 transitions. [2022-04-27 20:29:35,804 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2599 transitions. Word has length 28 [2022-04-27 20:29:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:35,804 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2599 transitions. [2022-04-27 20:29:35,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2599 transitions. [2022-04-27 20:29:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 20:29:35,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:35,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 20:29:35,806 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash 393022176, now seen corresponding path program 1 times [2022-04-27 20:29:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:35,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78056712] [2022-04-27 20:29:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:35,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {35196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35190#true} is VALID [2022-04-27 20:29:35,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {35190#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35190#true} {35190#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {35190#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {35196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {35190#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35190#true} {35190#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {35190#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {35190#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {35190#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {35190#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {35190#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {35190#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {35190#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {35190#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {35190#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-27 20:29:35,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {35190#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {35195#(= main_~p6~0 0)} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {35195#(= main_~p6~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {35195#(= main_~p6~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {35195#(= main_~p6~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {35195#(= main_~p6~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {35195#(= main_~p6~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {35195#(= main_~p6~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {35195#(= main_~p6~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {35195#(= main_~p6~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {35195#(= main_~p6~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {35195#(= main_~p6~0 0)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {35195#(= main_~p6~0 0)} is VALID [2022-04-27 20:29:35,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {35195#(= main_~p6~0 0)} [296] L148-1-->L154: Formula: (not (= v_main_~p6~0_2 0)) InVars {main_~p6~0=v_main_~p6~0_2} OutVars{main_~p6~0=v_main_~p6~0_2} AuxVars[] AssignedVars[] {35191#false} is VALID [2022-04-27 20:29:35,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {35191#false} [298] L154-->L184-1: Formula: (not (= v_main_~lk6~0_3 1)) InVars {main_~lk6~0=v_main_~lk6~0_3} OutVars{main_~lk6~0=v_main_~lk6~0_3} AuxVars[] AssignedVars[] {35191#false} is VALID [2022-04-27 20:29:35,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {35191#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35191#false} is VALID [2022-04-27 20:29:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:35,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78056712] [2022-04-27 20:29:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78056712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144224063] [2022-04-27 20:29:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:35,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:35,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:35,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:35,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:35,855 INFO L87 Difference]: Start difference. First operand 1673 states and 2599 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:36,123 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-27 20:29:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 20:29:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 20:29:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-27 20:29:36,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-27 20:29:36,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:36,346 INFO L225 Difference]: With dead ends: 2283 [2022-04-27 20:29:36,346 INFO L226 Difference]: Without dead ends: 2283 [2022-04-27 20:29:36,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:36,347 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:36,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-27 20:29:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-27 20:29:36,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:36,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,376 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,378 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:36,499 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-27 20:29:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-27 20:29:36,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:36,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:36,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-27 20:29:36,505 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2283 states. [2022-04-27 20:29:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:36,634 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-27 20:29:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-27 20:29:36,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:36,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:36,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:36,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5476504172156347) internal successors, (3524), 2277 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3527 transitions. [2022-04-27 20:29:36,765 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3527 transitions. Word has length 28 [2022-04-27 20:29:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:36,765 INFO L495 AbstractCegarLoop]: Abstraction has 2281 states and 3527 transitions. [2022-04-27 20:29:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3527 transitions. [2022-04-27 20:29:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 20:29:36,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:36,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 20:29:36,766 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -190647580, now seen corresponding path program 1 times [2022-04-27 20:29:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:36,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85461380] [2022-04-27 20:29:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:36,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {44338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {44332#true} is VALID [2022-04-27 20:29:36,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {44332#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44332#true} {44332#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {44332#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:36,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {44338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {44332#true} is VALID [2022-04-27 20:29:36,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {44332#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44332#true} {44332#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {44332#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {44332#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {44332#true} is VALID [2022-04-27 20:29:36,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {44332#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {44332#true} is VALID [2022-04-27 20:29:36,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {44332#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {44332#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {44332#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {44332#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {44332#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {44332#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-27 20:29:36,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {44332#true} [260] L94-1-->L98-1: Formula: (and (not (= v_main_~p6~0_4 0)) (= v_main_~lk6~0_6 1)) InVars {main_~p6~0=v_main_~p6~0_4} OutVars{main_~lk6~0=v_main_~lk6~0_6, main_~p6~0=v_main_~p6~0_4} AuxVars[] AssignedVars[main_~lk6~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {44337#(not (= main_~p6~0 0))} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {44337#(not (= main_~p6~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {44337#(not (= main_~p6~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {44337#(not (= main_~p6~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {44337#(not (= main_~p6~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {44337#(not (= main_~p6~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {44337#(not (= main_~p6~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {44337#(not (= main_~p6~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {44337#(not (= main_~p6~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {44337#(not (= main_~p6~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {44337#(not (= main_~p6~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {44337#(not (= main_~p6~0 0))} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {44337#(not (= main_~p6~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {44333#false} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {44333#false} [300] L153-1-->L159: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {44333#false} is VALID [2022-04-27 20:29:36,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {44333#false} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {44333#false} is VALID [2022-04-27 20:29:36,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {44333#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44333#false} is VALID [2022-04-27 20:29:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:36,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85461380] [2022-04-27 20:29:36,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85461380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:36,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:36,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181893274] [2022-04-27 20:29:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:36,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:36,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:36,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:36,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:36,822 INFO L87 Difference]: Start difference. First operand 2281 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:37,105 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-27 20:29:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 20:29:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 20:29:37,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-27 20:29:37,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:37,331 INFO L225 Difference]: With dead ends: 2315 [2022-04-27 20:29:37,331 INFO L226 Difference]: Without dead ends: 2315 [2022-04-27 20:29:37,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:37,332 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:37,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-27 20:29:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-27 20:29:37,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:37,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,358 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,360 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:37,485 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-27 20:29:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-27 20:29:37,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:37,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:37,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-27 20:29:37,491 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2315 states. [2022-04-27 20:29:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:37,615 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-27 20:29:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-27 20:29:37,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:37,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:37,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:37,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5262018189692508) internal successors, (3524), 2309 states have internal predecessors, (3524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3527 transitions. [2022-04-27 20:29:37,750 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3527 transitions. Word has length 29 [2022-04-27 20:29:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:37,750 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3527 transitions. [2022-04-27 20:29:37,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3527 transitions. [2022-04-27 20:29:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 20:29:37,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:37,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 20:29:37,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -701181757, now seen corresponding path program 1 times [2022-04-27 20:29:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469835815] [2022-04-27 20:29:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:37,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {53608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {53602#true} is VALID [2022-04-27 20:29:37,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {53602#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53602#true} {53602#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {53602#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {53608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {53602#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53602#true} {53602#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {53602#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {53602#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {53602#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {53602#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {53602#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {53602#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {53602#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {53602#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {53602#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {53602#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-27 20:29:37,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {53602#true} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {53607#(= main_~lk7~0 1)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {53607#(= main_~lk7~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {53607#(= main_~lk7~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {53607#(= main_~lk7~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {53607#(= main_~lk7~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {53607#(= main_~lk7~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {53607#(= main_~lk7~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {53607#(= main_~lk7~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {53607#(= main_~lk7~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {53607#(= main_~lk7~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {53607#(= main_~lk7~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {53607#(= main_~lk7~0 1)} [300] L153-1-->L159: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {53607#(= main_~lk7~0 1)} is VALID [2022-04-27 20:29:37,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {53607#(= main_~lk7~0 1)} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {53603#false} is VALID [2022-04-27 20:29:37,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {53603#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53603#false} is VALID [2022-04-27 20:29:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:37,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469835815] [2022-04-27 20:29:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469835815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:37,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:37,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:37,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050681491] [2022-04-27 20:29:37,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:37,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:37,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:37,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:37,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:37,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:37,823 INFO L87 Difference]: Start difference. First operand 2313 states and 3527 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:38,395 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-27 20:29:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-27 20:29:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-27 20:29:38,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-04-27 20:29:38,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:38,922 INFO L225 Difference]: With dead ends: 4107 [2022-04-27 20:29:38,922 INFO L226 Difference]: Without dead ends: 4107 [2022-04-27 20:29:38,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:38,923 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:38,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-27 20:29:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-27 20:29:38,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:38,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:38,964 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:38,966 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:39,376 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-27 20:29:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-27 20:29:39,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:39,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:39,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-27 20:29:39,385 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-27 20:29:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:39,804 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-27 20:29:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-27 20:29:39,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:39,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:39,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:39,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.4797479747974798) internal successors, (4932), 3333 states have internal predecessors, (4932), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4935 transitions. [2022-04-27 20:29:40,105 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4935 transitions. Word has length 29 [2022-04-27 20:29:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:40,105 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 4935 transitions. [2022-04-27 20:29:40,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4935 transitions. [2022-04-27 20:29:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 20:29:40,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:40,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 20:29:40,107 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:40,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash 806370052, now seen corresponding path program 1 times [2022-04-27 20:29:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:40,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013494625] [2022-04-27 20:29:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:40,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {69278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {69272#true} is VALID [2022-04-27 20:29:40,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {69272#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69272#true} {69272#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {69272#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:40,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {69278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {69272#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69272#true} {69272#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {69272#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {69272#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {69272#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {69272#true} is VALID [2022-04-27 20:29:40,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {69272#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {69272#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {69272#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {69272#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {69272#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {69272#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {69272#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {69272#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {69277#(= main_~p7~0 0)} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {69277#(= main_~p7~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {69277#(= main_~p7~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {69277#(= main_~p7~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {69277#(= main_~p7~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {69277#(= main_~p7~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {69277#(= main_~p7~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {69277#(= main_~p7~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {69277#(= main_~p7~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {69277#(= main_~p7~0 0)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {69277#(= main_~p7~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {69277#(= main_~p7~0 0)} is VALID [2022-04-27 20:29:40,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {69277#(= main_~p7~0 0)} [300] L153-1-->L159: Formula: (not (= v_main_~p7~0_2 0)) InVars {main_~p7~0=v_main_~p7~0_2} OutVars{main_~p7~0=v_main_~p7~0_2} AuxVars[] AssignedVars[] {69273#false} is VALID [2022-04-27 20:29:40,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {69273#false} [302] L159-->L184-1: Formula: (not (= v_main_~lk7~0_3 1)) InVars {main_~lk7~0=v_main_~lk7~0_3} OutVars{main_~lk7~0=v_main_~lk7~0_3} AuxVars[] AssignedVars[] {69273#false} is VALID [2022-04-27 20:29:40,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {69273#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69273#false} is VALID [2022-04-27 20:29:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013494625] [2022-04-27 20:29:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013494625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:40,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:40,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638393096] [2022-04-27 20:29:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:40,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:40,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:40,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:40,168 INFO L87 Difference]: Start difference. First operand 3337 states and 4935 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:40,827 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-27 20:29:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 20:29:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 20:29:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 20:29:40,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-27 20:29:40,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:41,475 INFO L225 Difference]: With dead ends: 4491 [2022-04-27 20:29:41,476 INFO L226 Difference]: Without dead ends: 4491 [2022-04-27 20:29:41,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:41,476 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:41,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-27 20:29:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-27 20:29:41,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:41,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:41,527 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:41,531 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:42,027 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-27 20:29:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-27 20:29:42,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:42,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:42,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-27 20:29:42,039 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4491 states. [2022-04-27 20:29:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:42,540 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-27 20:29:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-27 20:29:42,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:42,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:42,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:42,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.470680044593088) internal successors, (6596), 4485 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6599 transitions. [2022-04-27 20:29:43,027 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6599 transitions. Word has length 29 [2022-04-27 20:29:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:43,027 INFO L495 AbstractCegarLoop]: Abstraction has 4489 states and 6599 transitions. [2022-04-27 20:29:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6599 transitions. [2022-04-27 20:29:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 20:29:43,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:43,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:43,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 20:29:43,030 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -261765188, now seen corresponding path program 1 times [2022-04-27 20:29:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:43,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426451046] [2022-04-27 20:29:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:43,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:43,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {87252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {87246#true} is VALID [2022-04-27 20:29:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {87246#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87246#true} {87246#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {87246#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:43,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {87252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {87246#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87246#true} {87246#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {87246#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {87246#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {87246#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {87246#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {87246#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {87246#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {87246#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {87246#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {87246#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {87246#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-27 20:29:43,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {87246#true} [262] L98-1-->L102-1: Formula: (and (not (= v_main_~p7~0_4 0)) (= v_main_~lk7~0_6 1)) InVars {main_~p7~0=v_main_~p7~0_4} OutVars{main_~lk7~0=v_main_~lk7~0_6, main_~p7~0=v_main_~p7~0_4} AuxVars[] AssignedVars[main_~lk7~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {87251#(not (= main_~p7~0 0))} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {87251#(not (= main_~p7~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {87251#(not (= main_~p7~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {87251#(not (= main_~p7~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {87251#(not (= main_~p7~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {87251#(not (= main_~p7~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {87251#(not (= main_~p7~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {87251#(not (= main_~p7~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {87251#(not (= main_~p7~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {87251#(not (= main_~p7~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {87251#(not (= main_~p7~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {87251#(not (= main_~p7~0 0))} is VALID [2022-04-27 20:29:43,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {87251#(not (= main_~p7~0 0))} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {87247#false} is VALID [2022-04-27 20:29:43,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {87247#false} [304] L158-1-->L164: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {87247#false} is VALID [2022-04-27 20:29:43,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {87247#false} [306] L164-->L184-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {87247#false} is VALID [2022-04-27 20:29:43,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {87247#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87247#false} is VALID [2022-04-27 20:29:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426451046] [2022-04-27 20:29:43,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426451046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:43,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:43,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682196025] [2022-04-27 20:29:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:43,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:43,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:43,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:43,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:43,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:43,097 INFO L87 Difference]: Start difference. First operand 4489 states and 6599 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:43,754 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-27 20:29:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:43,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-27 20:29:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-27 20:29:43,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 140 transitions. [2022-04-27 20:29:43,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:44,417 INFO L225 Difference]: With dead ends: 4555 [2022-04-27 20:29:44,417 INFO L226 Difference]: Without dead ends: 4555 [2022-04-27 20:29:44,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:44,418 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:44,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-27 20:29:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-27 20:29:44,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:44,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:44,468 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:44,471 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:44,978 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-27 20:29:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-27 20:29:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:44,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states. [2022-04-27 20:29:44,990 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4555 states. [2022-04-27 20:29:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:45,502 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-27 20:29:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-27 20:29:45,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:45,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:45,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:45,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.449989008573313) internal successors, (6596), 4549 states have internal predecessors, (6596), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6599 transitions. [2022-04-27 20:29:46,081 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6599 transitions. Word has length 30 [2022-04-27 20:29:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:46,081 INFO L495 AbstractCegarLoop]: Abstraction has 4553 states and 6599 transitions. [2022-04-27 20:29:46,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6599 transitions. [2022-04-27 20:29:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 20:29:46,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:46,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:46,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 20:29:46,083 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -772299365, now seen corresponding path program 1 times [2022-04-27 20:29:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:46,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011274613] [2022-04-27 20:29:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:46,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {105482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {105476#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105476#true} {105476#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {105476#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:46,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {105482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {105476#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105476#true} {105476#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {105476#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {105476#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {105476#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {105476#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {105476#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {105476#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {105476#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {105476#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {105476#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {105476#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {105476#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {105476#true} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {105481#(= main_~lk8~0 1)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {105481#(= main_~lk8~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {105481#(= main_~lk8~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {105481#(= main_~lk8~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {105481#(= main_~lk8~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {105481#(= main_~lk8~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {105481#(= main_~lk8~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {105481#(= main_~lk8~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {105481#(= main_~lk8~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {105481#(= main_~lk8~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {105481#(= main_~lk8~0 1)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {105481#(= main_~lk8~0 1)} [304] L158-1-->L164: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {105481#(= main_~lk8~0 1)} is VALID [2022-04-27 20:29:46,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {105481#(= main_~lk8~0 1)} [306] L164-->L184-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {105477#false} is VALID [2022-04-27 20:29:46,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {105477#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105477#false} is VALID [2022-04-27 20:29:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011274613] [2022-04-27 20:29:46,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011274613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:46,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:46,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126367238] [2022-04-27 20:29:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:46,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:46,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:46,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:46,126 INFO L87 Difference]: Start difference. First operand 4553 states and 6599 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:47,898 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-27 20:29:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-27 20:29:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-27 20:29:47,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-27 20:29:47,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:49,618 INFO L225 Difference]: With dead ends: 7947 [2022-04-27 20:29:49,619 INFO L226 Difference]: Without dead ends: 7947 [2022-04-27 20:29:49,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:49,619 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:49,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-27 20:29:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-27 20:29:49,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:49,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:49,688 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:49,694 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:51,301 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-27 20:29:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-27 20:29:51,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:51,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:51,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states. [2022-04-27 20:29:51,320 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7947 states. [2022-04-27 20:29:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:52,977 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-27 20:29:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-27 20:29:52,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:29:52,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:29:52,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:29:52,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:29:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4033928839513587) internal successors, (9348), 6661 states have internal predecessors, (9348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9351 transitions. [2022-04-27 20:29:54,314 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9351 transitions. Word has length 30 [2022-04-27 20:29:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:29:54,314 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9351 transitions. [2022-04-27 20:29:54,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9351 transitions. [2022-04-27 20:29:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 20:29:54,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:29:54,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:29:54,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 20:29:54,318 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:29:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:29:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 735252444, now seen corresponding path program 1 times [2022-04-27 20:29:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:29:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841431809] [2022-04-27 20:29:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:29:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:29:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:29:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:29:54,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {136000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {135994#true} is VALID [2022-04-27 20:29:54,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {135994#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135994#true} {135994#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {135994#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:29:54,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {136000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {135994#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135994#true} {135994#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {135994#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {135994#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {135994#true} is VALID [2022-04-27 20:29:54,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {135994#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {135994#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {135994#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {135994#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {135994#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {135994#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {135994#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {135994#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {135994#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {135994#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {135999#(= main_~p8~0 0)} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {135999#(= main_~p8~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {135999#(= main_~p8~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {135999#(= main_~p8~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {135999#(= main_~p8~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {135999#(= main_~p8~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {135999#(= main_~p8~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {135999#(= main_~p8~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {135999#(= main_~p8~0 0)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {135999#(= main_~p8~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {135999#(= main_~p8~0 0)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {135999#(= main_~p8~0 0)} is VALID [2022-04-27 20:29:54,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {135999#(= main_~p8~0 0)} [304] L158-1-->L164: Formula: (not (= v_main_~p8~0_2 0)) InVars {main_~p8~0=v_main_~p8~0_2} OutVars{main_~p8~0=v_main_~p8~0_2} AuxVars[] AssignedVars[] {135995#false} is VALID [2022-04-27 20:29:54,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {135995#false} [306] L164-->L184-1: Formula: (not (= v_main_~lk8~0_3 1)) InVars {main_~lk8~0=v_main_~lk8~0_3} OutVars{main_~lk8~0=v_main_~lk8~0_3} AuxVars[] AssignedVars[] {135995#false} is VALID [2022-04-27 20:29:54,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {135995#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135995#false} is VALID [2022-04-27 20:29:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:29:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:29:54,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841431809] [2022-04-27 20:29:54,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841431809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:29:54,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:29:54,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:29:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867766261] [2022-04-27 20:29:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:29:54,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:54,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:29:54,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:54,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:29:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:29:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:29:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:29:54,370 INFO L87 Difference]: Start difference. First operand 6665 states and 9351 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:29:56,443 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-27 20:29:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:29:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 20:29:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:29:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 20:29:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 20:29:56,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-27 20:29:56,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:29:58,465 INFO L225 Difference]: With dead ends: 8843 [2022-04-27 20:29:58,465 INFO L226 Difference]: Without dead ends: 8843 [2022-04-27 20:29:58,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:29:58,465 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:29:58,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:29:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-27 20:29:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-27 20:29:58,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:29:58,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:58,552 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:29:58,561 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:00,538 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-27 20:30:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-27 20:30:00,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:00,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:00,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states. [2022-04-27 20:30:00,564 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8843 states. [2022-04-27 20:30:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:02,619 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-27 20:30:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-27 20:30:02,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:02,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:02,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:02,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.3909697861265136) internal successors, (12292), 8837 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12295 transitions. [2022-04-27 20:30:04,898 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12295 transitions. Word has length 30 [2022-04-27 20:30:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:04,898 INFO L495 AbstractCegarLoop]: Abstraction has 8841 states and 12295 transitions. [2022-04-27 20:30:04,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12295 transitions. [2022-04-27 20:30:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 20:30:04,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:04,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:04,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 20:30:04,901 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1828556384, now seen corresponding path program 1 times [2022-04-27 20:30:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:04,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671104559] [2022-04-27 20:30:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:04,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {171382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171376#true} is VALID [2022-04-27 20:30:04,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {171376#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171376#true} {171376#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {171376#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {171382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {171376#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171376#true} {171376#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {171376#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {171376#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {171376#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {171376#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {171376#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {171376#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {171376#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {171376#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {171376#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {171376#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {171376#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-27 20:30:04,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {171376#true} [264] L102-1-->L106-1: Formula: (and (= v_main_~lk8~0_6 1) (not (= v_main_~p8~0_4 0))) InVars {main_~p8~0=v_main_~p8~0_4} OutVars{main_~p8~0=v_main_~p8~0_4, main_~lk8~0=v_main_~lk8~0_6} AuxVars[] AssignedVars[main_~lk8~0] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {171381#(not (= main_~p8~0 0))} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {171381#(not (= main_~p8~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {171381#(not (= main_~p8~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {171381#(not (= main_~p8~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {171381#(not (= main_~p8~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {171381#(not (= main_~p8~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {171381#(not (= main_~p8~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {171381#(not (= main_~p8~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {171381#(not (= main_~p8~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {171381#(not (= main_~p8~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {171381#(not (= main_~p8~0 0))} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {171381#(not (= main_~p8~0 0))} is VALID [2022-04-27 20:30:04,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {171381#(not (= main_~p8~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {171377#false} is VALID [2022-04-27 20:30:04,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {171377#false} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {171377#false} is VALID [2022-04-27 20:30:04,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {171377#false} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {171377#false} is VALID [2022-04-27 20:30:04,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {171377#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171377#false} is VALID [2022-04-27 20:30:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:30:04,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:04,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671104559] [2022-04-27 20:30:04,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671104559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:04,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:04,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862943217] [2022-04-27 20:30:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:04,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:04,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:04,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:04,998 INFO L87 Difference]: Start difference. First operand 8841 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:07,204 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-27 20:30:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 20:30:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 20:30:07,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-27 20:30:07,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:09,554 INFO L225 Difference]: With dead ends: 8971 [2022-04-27 20:30:09,555 INFO L226 Difference]: Without dead ends: 8971 [2022-04-27 20:30:09,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:30:09,555 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:09,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-27 20:30:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-27 20:30:09,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:09,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:09,650 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:09,660 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:11,679 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-27 20:30:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-27 20:30:11,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:11,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:11,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states. [2022-04-27 20:30:11,705 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8971 states. [2022-04-27 20:30:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:13,754 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-27 20:30:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-27 20:30:13,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:13,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:13,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:13,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.3711098717233687) internal successors, (12292), 8965 states have internal predecessors, (12292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12295 transitions. [2022-04-27 20:30:15,798 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12295 transitions. Word has length 31 [2022-04-27 20:30:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:15,798 INFO L495 AbstractCegarLoop]: Abstraction has 8969 states and 12295 transitions. [2022-04-27 20:30:15,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12295 transitions. [2022-04-27 20:30:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 20:30:15,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:15,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:15,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 20:30:15,801 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1318022207, now seen corresponding path program 1 times [2022-04-27 20:30:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:15,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970251645] [2022-04-27 20:30:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:15,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {207276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {207270#true} is VALID [2022-04-27 20:30:15,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {207270#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {207270#true} {207270#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {207270#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {207276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {207270#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207270#true} {207270#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {207270#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {207270#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {207270#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {207270#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {207270#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {207270#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {207270#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {207270#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {207270#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {207270#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {207270#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {207270#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {207270#true} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {207275#(= main_~lk9~0 1)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {207275#(= main_~lk9~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {207275#(= main_~lk9~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {207275#(= main_~lk9~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {207275#(= main_~lk9~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {207275#(= main_~lk9~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {207275#(= main_~lk9~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {207275#(= main_~lk9~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {207275#(= main_~lk9~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {207275#(= main_~lk9~0 1)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {207275#(= main_~lk9~0 1)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {207275#(= main_~lk9~0 1)} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {207275#(= main_~lk9~0 1)} is VALID [2022-04-27 20:30:15,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {207275#(= main_~lk9~0 1)} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {207271#false} is VALID [2022-04-27 20:30:15,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {207271#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207271#false} is VALID [2022-04-27 20:30:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:30:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970251645] [2022-04-27 20:30:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970251645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:15,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:15,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584667551] [2022-04-27 20:30:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:15,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:15,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:15,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:15,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:15,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:15,856 INFO L87 Difference]: Start difference. First operand 8969 states and 12295 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:22,090 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-27 20:30:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:22,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-27 20:30:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-27 20:30:22,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-27 20:30:22,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:28,807 INFO L225 Difference]: With dead ends: 15371 [2022-04-27 20:30:28,808 INFO L226 Difference]: Without dead ends: 15371 [2022-04-27 20:30:28,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:30:28,808 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:30:28,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:30:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-27 20:30:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-27 20:30:28,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:30:28,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:28,993 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:29,007 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:35,041 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-27 20:30:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-27 20:30:35,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:35,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:35,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states. [2022-04-27 20:30:35,080 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15371 states. [2022-04-27 20:30:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:41,159 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-27 20:30:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-27 20:30:41,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:30:41,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:30:41,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:30:41,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:30:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.326725238417061) internal successors, (17668), 13317 states have internal predecessors, (17668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 17671 transitions. [2022-04-27 20:30:45,387 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 17671 transitions. Word has length 31 [2022-04-27 20:30:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:30:45,388 INFO L495 AbstractCegarLoop]: Abstraction has 13321 states and 17671 transitions. [2022-04-27 20:30:45,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 17671 transitions. [2022-04-27 20:30:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 20:30:45,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:30:45,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:30:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 20:30:45,394 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:30:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:30:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1469393280, now seen corresponding path program 1 times [2022-04-27 20:30:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:30:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106091264] [2022-04-27 20:30:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:30:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:30:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:45,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:30:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:30:45,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {266722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {266716#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266716#true} {266716#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {266716#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:30:45,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {266722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {266716#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266716#true} {266716#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {266716#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {266716#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {266716#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {266716#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {266716#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {266716#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {266716#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {266716#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {266716#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {266716#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {266716#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {266716#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-27 20:30:45,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {266716#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {266721#(= main_~p9~0 0)} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {266721#(= main_~p9~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {266721#(= main_~p9~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {266721#(= main_~p9~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {266721#(= main_~p9~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {266721#(= main_~p9~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {266721#(= main_~p9~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {266721#(= main_~p9~0 0)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {266721#(= main_~p9~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {266721#(= main_~p9~0 0)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {266721#(= main_~p9~0 0)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {266721#(= main_~p9~0 0)} is VALID [2022-04-27 20:30:45,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {266721#(= main_~p9~0 0)} [308] L163-1-->L169: Formula: (not (= v_main_~p9~0_2 0)) InVars {main_~p9~0=v_main_~p9~0_2} OutVars{main_~p9~0=v_main_~p9~0_2} AuxVars[] AssignedVars[] {266717#false} is VALID [2022-04-27 20:30:45,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {266717#false} [310] L169-->L184-1: Formula: (not (= v_main_~lk9~0_3 1)) InVars {main_~lk9~0=v_main_~lk9~0_3} OutVars{main_~lk9~0=v_main_~lk9~0_3} AuxVars[] AssignedVars[] {266717#false} is VALID [2022-04-27 20:30:45,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {266717#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266717#false} is VALID [2022-04-27 20:30:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:30:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:30:45,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106091264] [2022-04-27 20:30:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106091264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:30:45,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:30:45,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:30:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784673261] [2022-04-27 20:30:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:30:45,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:45,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:30:45,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:45,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:30:45,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:30:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:30:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:30:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:30:45,462 INFO L87 Difference]: Start difference. First operand 13321 states and 17671 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:30:52,867 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-27 20:30:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:30:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 20:30:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:30:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-27 20:30:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:30:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-27 20:30:52,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 137 transitions. [2022-04-27 20:30:52,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:01,028 INFO L225 Difference]: With dead ends: 17419 [2022-04-27 20:31:01,028 INFO L226 Difference]: Without dead ends: 17419 [2022-04-27 20:31:01,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:31:01,029 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:01,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-27 20:31:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-27 20:31:01,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:01,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:01,179 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:01,194 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:08,358 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-27 20:31:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-27 20:31:08,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:08,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:08,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states. [2022-04-27 20:31:08,399 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17419 states. [2022-04-27 20:31:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:15,172 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-27 20:31:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-27 20:31:15,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:15,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:15,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:15,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3086774249124218) internal successors, (22788), 17413 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 22791 transitions. [2022-04-27 20:31:23,651 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 22791 transitions. Word has length 31 [2022-04-27 20:31:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:31:23,651 INFO L495 AbstractCegarLoop]: Abstraction has 17417 states and 22791 transitions. [2022-04-27 20:31:23,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 22791 transitions. [2022-04-27 20:31:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 20:31:23,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:31:23,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:31:23,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 20:31:23,657 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:31:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:31:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2090951496, now seen corresponding path program 1 times [2022-04-27 20:31:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:31:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152747542] [2022-04-27 20:31:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:31:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:31:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:31:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:31:23,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {336408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {336402#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {336402#true} {336402#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {336402#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:31:23,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {336408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {336402#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336402#true} {336402#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {336402#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {336402#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {336402#true} is VALID [2022-04-27 20:31:23,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {336402#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {336402#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {336402#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {336402#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {336402#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {336402#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {336402#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {336402#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {336402#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {336402#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {336402#true} [266] L106-1-->L110-1: Formula: (and (= v_main_~lk9~0_6 1) (not (= v_main_~p9~0_4 0))) InVars {main_~p9~0=v_main_~p9~0_4} OutVars{main_~lk9~0=v_main_~lk9~0_6, main_~p9~0=v_main_~p9~0_4} AuxVars[] AssignedVars[main_~lk9~0] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {336407#(not (= main_~p9~0 0))} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {336407#(not (= main_~p9~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {336407#(not (= main_~p9~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {336407#(not (= main_~p9~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {336407#(not (= main_~p9~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {336407#(not (= main_~p9~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {336407#(not (= main_~p9~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {336407#(not (= main_~p9~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {336407#(not (= main_~p9~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {336407#(not (= main_~p9~0 0))} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {336407#(not (= main_~p9~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {336407#(not (= main_~p9~0 0))} is VALID [2022-04-27 20:31:23,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {336407#(not (= main_~p9~0 0))} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {336403#false} is VALID [2022-04-27 20:31:23,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {336403#false} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {336403#false} is VALID [2022-04-27 20:31:23,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {336403#false} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {336403#false} is VALID [2022-04-27 20:31:23,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {336403#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336403#false} is VALID [2022-04-27 20:31:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:31:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:31:23,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152747542] [2022-04-27 20:31:23,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152747542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:31:23,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:31:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:31:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327080596] [2022-04-27 20:31:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:31:23,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:31:23,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:31:23,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:23,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:31:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:31:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:31:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:31:23,719 INFO L87 Difference]: Start difference. First operand 17417 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:30,736 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-27 20:31:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:31:30,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:31:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:31:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 20:31:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 20:31:30,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-27 20:31:30,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:31:38,519 INFO L225 Difference]: With dead ends: 17675 [2022-04-27 20:31:38,519 INFO L226 Difference]: Without dead ends: 17675 [2022-04-27 20:31:38,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:31:38,520 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:31:38,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:31:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-27 20:31:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-27 20:31:38,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:31:38,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:38,674 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:38,687 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:31:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:46,741 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-27 20:31:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-27 20:31:46,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:46,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:46,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states. [2022-04-27 20:31:46,779 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17675 states. [2022-04-27 20:31:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:31:53,628 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-27 20:31:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-27 20:31:53,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:31:53,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:31:53,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:31:53,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:31:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.2897164525440037) internal successors, (22788), 17669 states have internal predecessors, (22788), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 22791 transitions. [2022-04-27 20:32:02,425 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 22791 transitions. Word has length 32 [2022-04-27 20:32:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:32:02,425 INFO L495 AbstractCegarLoop]: Abstraction has 17673 states and 22791 transitions. [2022-04-27 20:32:02,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 22791 transitions. [2022-04-27 20:32:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 20:32:02,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:32:02,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:32:02,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 20:32:02,431 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:32:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:32:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1693481623, now seen corresponding path program 1 times [2022-04-27 20:32:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:32:02,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978915060] [2022-04-27 20:32:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:32:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:32:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:32:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:32:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:32:02,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {407118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {407112#true} is VALID [2022-04-27 20:32:02,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {407112#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {407112#true} {407112#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {407112#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {407118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {407112#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407112#true} {407112#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {407112#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {407112#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {407112#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {407112#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {407112#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {407112#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {407112#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {407112#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {407112#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {407112#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {407112#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {407112#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {407112#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {407112#true} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {407117#(= main_~lk10~0 1)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {407117#(= main_~lk10~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {407117#(= main_~lk10~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {407117#(= main_~lk10~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {407117#(= main_~lk10~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {407117#(= main_~lk10~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {407117#(= main_~lk10~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {407117#(= main_~lk10~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {407117#(= main_~lk10~0 1)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {407117#(= main_~lk10~0 1)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {407117#(= main_~lk10~0 1)} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {407117#(= main_~lk10~0 1)} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {407117#(= main_~lk10~0 1)} is VALID [2022-04-27 20:32:02,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {407117#(= main_~lk10~0 1)} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {407113#false} is VALID [2022-04-27 20:32:02,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {407113#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407113#false} is VALID [2022-04-27 20:32:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:32:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:32:02,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978915060] [2022-04-27 20:32:02,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978915060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:32:02,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:32:02,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:32:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219370156] [2022-04-27 20:32:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:32:02,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:32:02,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:32:02,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:02,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:32:02,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:32:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:32:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:32:02,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:32:02,489 INFO L87 Difference]: Start difference. First operand 17673 states and 22791 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:32:27,685 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-27 20:32:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:32:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:32:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:32:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 20:32:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 20:32:27,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-27 20:32:27,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:32:52,848 INFO L225 Difference]: With dead ends: 29707 [2022-04-27 20:32:52,848 INFO L226 Difference]: Without dead ends: 29707 [2022-04-27 20:32:52,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:32:52,849 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:32:52,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:32:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29707 states. [2022-04-27 20:32:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29707 to 26633. [2022-04-27 20:32:53,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:32:53,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:53,190 INFO L74 IsIncluded]: Start isIncluded. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:32:53,219 INFO L87 Difference]: Start difference. First operand 29707 states. Second operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:33:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:33:17,498 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-27 20:33:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-27 20:33:17,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:33:17,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:33:17,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29707 states. [2022-04-27 20:33:17,558 INFO L87 Difference]: Start difference. First operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29707 states. [2022-04-27 20:33:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:33:42,160 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-27 20:33:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-27 20:33:42,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:33:42,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:33:42,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:33:42,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:33:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26633 states, 26629 states have (on average 1.249915505651733) internal successors, (33284), 26629 states have internal predecessors, (33284), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:33:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26633 states to 26633 states and 33287 transitions. [2022-04-27 20:33:59,530 INFO L78 Accepts]: Start accepts. Automaton has 26633 states and 33287 transitions. Word has length 32 [2022-04-27 20:33:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:33:59,530 INFO L495 AbstractCegarLoop]: Abstraction has 26633 states and 33287 transitions. [2022-04-27 20:33:59,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:33:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 26633 states and 33287 transitions. [2022-04-27 20:33:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 20:33:59,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:33:59,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:33:59,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 20:33:59,541 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:33:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:33:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1093933864, now seen corresponding path program 1 times [2022-04-27 20:33:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:33:59,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475474533] [2022-04-27 20:33:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:33:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:33:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:33:59,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:33:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:33:59,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {522884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {522878#true} is VALID [2022-04-27 20:33:59,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {522878#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {522878#true} {522878#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {522878#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {522884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {522878#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {522878#true} {522878#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {522878#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {522878#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {522878#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {522878#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {522878#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {522878#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {522878#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {522878#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {522878#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {522878#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {522878#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {522878#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {522878#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {522878#true} [269] L110-1-->L114-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {522883#(= main_~p10~0 0)} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {522883#(= main_~p10~0 0)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {522883#(= main_~p10~0 0)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {522883#(= main_~p10~0 0)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {522883#(= main_~p10~0 0)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {522883#(= main_~p10~0 0)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {522883#(= main_~p10~0 0)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {522883#(= main_~p10~0 0)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {522883#(= main_~p10~0 0)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {522883#(= main_~p10~0 0)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {522883#(= main_~p10~0 0)} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {522883#(= main_~p10~0 0)} is VALID [2022-04-27 20:33:59,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {522883#(= main_~p10~0 0)} [312] L168-1-->L174: Formula: (not (= v_main_~p10~0_2 0)) InVars {main_~p10~0=v_main_~p10~0_2} OutVars{main_~p10~0=v_main_~p10~0_2} AuxVars[] AssignedVars[] {522879#false} is VALID [2022-04-27 20:33:59,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {522879#false} [314] L174-->L184-1: Formula: (not (= v_main_~lk10~0_3 1)) InVars {main_~lk10~0=v_main_~lk10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_3} AuxVars[] AssignedVars[] {522879#false} is VALID [2022-04-27 20:33:59,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {522879#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522879#false} is VALID [2022-04-27 20:33:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:33:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:33:59,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475474533] [2022-04-27 20:33:59,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475474533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:33:59,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:33:59,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:33:59,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064478301] [2022-04-27 20:33:59,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:33:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:33:59,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:33:59,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:33:59,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:33:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:33:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:33:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:33:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:33:59,586 INFO L87 Difference]: Start difference. First operand 26633 states and 33287 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:34:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:34:27,477 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-27 20:34:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:34:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 20:34:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:34:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:34:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 20:34:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:34:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-27 20:34:27,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-27 20:34:27,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:34:59,201 INFO L225 Difference]: With dead ends: 34315 [2022-04-27 20:34:59,202 INFO L226 Difference]: Without dead ends: 34315 [2022-04-27 20:34:59,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:34:59,202 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:34:59,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:34:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-27 20:34:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-27 20:34:59,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:34:59,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:34:59,545 INFO L74 IsIncluded]: Start isIncluded. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:34:59,578 INFO L87 Difference]: Start difference. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:35:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:35:27,463 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-27 20:35:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-27 20:35:27,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:35:27,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:35:27,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34315 states. [2022-04-27 20:35:27,541 INFO L87 Difference]: Start difference. First operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34315 states. [2022-04-27 20:36:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:36:06,775 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-27 20:36:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-27 20:36:06,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:36:06,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:36:06,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:36:06,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:36:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34313 states, 34309 states have (on average 1.2238188230493456) internal successors, (41988), 34309 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:36:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 41991 transitions. [2022-04-27 20:36:45,159 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 41991 transitions. Word has length 32 [2022-04-27 20:36:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:36:45,159 INFO L495 AbstractCegarLoop]: Abstraction has 34313 states and 41991 transitions. [2022-04-27 20:36:45,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:36:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 41991 transitions. [2022-04-27 20:36:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 20:36:45,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:36:45,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:36:45,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-27 20:36:45,172 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:36:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:36:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash 958355932, now seen corresponding path program 1 times [2022-04-27 20:36:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:36:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477843525] [2022-04-27 20:36:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:36:45,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:36:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:36:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:36:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:36:45,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {660154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {660148#true} is VALID [2022-04-27 20:36:45,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {660148#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {660148#true} {660148#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {660148#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {660154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {660148#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {660148#true} {660148#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {660148#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {660148#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {660148#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {660148#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {660148#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {660148#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {660148#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {660148#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {660148#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {660148#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {660148#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {660148#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {660148#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {660148#true} [268] L110-1-->L114-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {660153#(not (= main_~p10~0 0))} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {660153#(not (= main_~p10~0 0))} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {660153#(not (= main_~p10~0 0))} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {660153#(not (= main_~p10~0 0))} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {660153#(not (= main_~p10~0 0))} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {660153#(not (= main_~p10~0 0))} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {660153#(not (= main_~p10~0 0))} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {660153#(not (= main_~p10~0 0))} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {660153#(not (= main_~p10~0 0))} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {660153#(not (= main_~p10~0 0))} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {660153#(not (= main_~p10~0 0))} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {660153#(not (= main_~p10~0 0))} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {660153#(not (= main_~p10~0 0))} [313] L168-1-->L173-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {660149#false} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {660149#false} [316] L173-1-->L179: Formula: (not (= v_main_~p11~0_2 0)) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[] {660149#false} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {660149#false} [318] L179-->L184-1: Formula: (not (= v_main_~lk11~0_3 1)) InVars {main_~lk11~0=v_main_~lk11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_3} AuxVars[] AssignedVars[] {660149#false} is VALID [2022-04-27 20:36:45,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {660149#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660149#false} is VALID [2022-04-27 20:36:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:36:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:36:45,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477843525] [2022-04-27 20:36:45,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477843525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:36:45,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:36:45,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:36:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114640866] [2022-04-27 20:36:45,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:36:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 20:36:45,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:36:45,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:36:45,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:36:45,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:36:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:36:45,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:36:45,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:36:45,230 INFO L87 Difference]: Start difference. First operand 34313 states and 41991 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:37:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:37:33,131 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-27 20:37:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:37:33,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 20:37:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:37:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:37:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-27 20:37:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:37:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-27 20:37:33,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-27 20:37:33,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:38:10,826 INFO L225 Difference]: With dead ends: 34827 [2022-04-27 20:38:10,827 INFO L226 Difference]: Without dead ends: 34827 [2022-04-27 20:38:10,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:38:10,827 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:38:10,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 106 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:38:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34827 states. [2022-04-27 20:38:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34827 to 34825. [2022-04-27 20:38:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:38:11,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34827 states. Second operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:38:11,173 INFO L74 IsIncluded]: Start isIncluded. First operand 34827 states. Second operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:38:11,209 INFO L87 Difference]: Start difference. First operand 34827 states. Second operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:38:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:38:38,851 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-27 20:38:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 34827 states and 41992 transitions. [2022-04-27 20:38:38,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:38:38,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:38:38,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34827 states. [2022-04-27 20:38:38,938 INFO L87 Difference]: Start difference. First operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34827 states. [2022-04-27 20:39:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:39:20,870 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-27 20:39:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34827 states and 41992 transitions. [2022-04-27 20:39:20,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:39:20,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:39:20,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:39:20,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:39:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34825 states, 34821 states have (on average 1.2058240716808821) internal successors, (41988), 34821 states have internal predecessors, (41988), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:39:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 41991 transitions. [2022-04-27 20:39:59,963 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 41991 transitions. Word has length 33 [2022-04-27 20:39:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:39:59,963 INFO L495 AbstractCegarLoop]: Abstraction has 34825 states and 41991 transitions. [2022-04-27 20:39:59,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:39:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 41991 transitions. [2022-04-27 20:39:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 20:39:59,975 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:39:59,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:39:59,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-27 20:39:59,976 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:39:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:39:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 447821755, now seen corresponding path program 1 times [2022-04-27 20:39:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:39:59,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997629775] [2022-04-27 20:39:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:39:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:40:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:40:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:40:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:40:00,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {799472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {799466#true} is VALID [2022-04-27 20:40:00,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {799466#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799466#true} {799466#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {799466#true} [237] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {799472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [239] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {799466#true} [242] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799466#true} {799466#true} [324] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {799466#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {799466#true} [241] mainENTRY-->L183-1: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (= |v_main_#t~nondet15_2| v_main_~p12~0_1) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p5~0_1 |v_main_#t~nondet8_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet15=|v_main_#t~nondet15_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~lk12~0=v_main_~lk12~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~p2~0=v_main_~p2~0_1, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~p5~0=v_main_~p5~0_1, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~p10~0=v_main_~p10~0_1, main_~lk6~0=v_main_~lk6~0_1, main_~p9~0=v_main_~p9~0_1, main_~lk3~0=v_main_~lk3~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk4~0=v_main_~lk4~0_4, main_~p3~0=v_main_~p3~0_1, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~lk12~0, main_~lk5~0, main_~p2~0, main_#t~nondet9, main_#t~nondet8, main_~cond~0, main_~p6~0, main_~p5~0, main_~lk2~0, main_~lk11~0, main_~p10~0, main_~lk6~0, main_~p9~0, main_~lk3~0, main_~p8~0, main_~lk10~0, main_~p11~0, main_~lk9~0, main_~p4~0, main_~lk7~0, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {799466#true} [245] L183-1-->L49: Formula: (and (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (= |v_main_#t~nondet16_2| v_main_~cond~0_2) (<= |v_main_#t~nondet16_2| 2147483647)) InVars {main_#t~nondet16=|v_main_#t~nondet16_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet16, main_~cond~0] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {799466#true} [248] L49-->L78: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk5~0_5 0) (= v_main_~lk6~0_2 0) (= v_main_~lk12~0_2 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk12~0=v_main_~lk12~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_5, main_~lk6~0=v_main_~lk6~0_2, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {799466#true} [251] L78-->L78-2: Formula: (= v_main_~p1~0_3 0) InVars {main_~p1~0=v_main_~p1~0_3} OutVars{main_~p1~0=v_main_~p1~0_3} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {799466#true} [253] L78-2-->L82-1: Formula: (= v_main_~p2~0_3 0) InVars {main_~p2~0=v_main_~p2~0_3} OutVars{main_~p2~0=v_main_~p2~0_3} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {799466#true} [255] L82-1-->L86-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {799466#true} [257] L86-1-->L90-1: Formula: (= v_main_~p4~0_5 0) InVars {main_~p4~0=v_main_~p4~0_5} OutVars{main_~p4~0=v_main_~p4~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {799466#true} [259] L90-1-->L94-1: Formula: (= v_main_~p5~0_5 0) InVars {main_~p5~0=v_main_~p5~0_5} OutVars{main_~p5~0=v_main_~p5~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {799466#true} [261] L94-1-->L98-1: Formula: (= v_main_~p6~0_5 0) InVars {main_~p6~0=v_main_~p6~0_5} OutVars{main_~p6~0=v_main_~p6~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {799466#true} [263] L98-1-->L102-1: Formula: (= v_main_~p7~0_5 0) InVars {main_~p7~0=v_main_~p7~0_5} OutVars{main_~p7~0=v_main_~p7~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {799466#true} [265] L102-1-->L106-1: Formula: (= v_main_~p8~0_5 0) InVars {main_~p8~0=v_main_~p8~0_5} OutVars{main_~p8~0=v_main_~p8~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {799466#true} [267] L106-1-->L110-1: Formula: (= v_main_~p9~0_5 0) InVars {main_~p9~0=v_main_~p9~0_5} OutVars{main_~p9~0=v_main_~p9~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {799466#true} [269] L110-1-->L114-1: Formula: (= v_main_~p10~0_5 0) InVars {main_~p10~0=v_main_~p10~0_5} OutVars{main_~p10~0=v_main_~p10~0_5} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-27 20:40:00,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {799466#true} [270] L114-1-->L118-1: Formula: (and (not (= v_main_~p11~0_3 0)) (= v_main_~lk11~0_6 1)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[main_~lk11~0] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {799471#(= main_~lk11~0 1)} [272] L118-1-->L122-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_3 0))) InVars {main_~p12~0=v_main_~p12~0_3} OutVars{main_~p12~0=v_main_~p12~0_3, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {799471#(= main_~lk11~0 1)} [275] L122-1-->L128-1: Formula: (= v_main_~p1~0_5 0) InVars {main_~p1~0=v_main_~p1~0_5} OutVars{main_~p1~0=v_main_~p1~0_5} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {799471#(= main_~lk11~0 1)} [279] L128-1-->L133-1: Formula: (= v_main_~p2~0_5 0) InVars {main_~p2~0=v_main_~p2~0_5} OutVars{main_~p2~0=v_main_~p2~0_5} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {799471#(= main_~lk11~0 1)} [285] L133-1-->L138-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {799471#(= main_~lk11~0 1)} [289] L138-1-->L143-1: Formula: (= v_main_~p4~0_3 0) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {799471#(= main_~lk11~0 1)} [293] L143-1-->L148-1: Formula: (= v_main_~p5~0_3 0) InVars {main_~p5~0=v_main_~p5~0_3} OutVars{main_~p5~0=v_main_~p5~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {799471#(= main_~lk11~0 1)} [297] L148-1-->L153-1: Formula: (= v_main_~p6~0_3 0) InVars {main_~p6~0=v_main_~p6~0_3} OutVars{main_~p6~0=v_main_~p6~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {799471#(= main_~lk11~0 1)} [301] L153-1-->L158-1: Formula: (= v_main_~p7~0_3 0) InVars {main_~p7~0=v_main_~p7~0_3} OutVars{main_~p7~0=v_main_~p7~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {799471#(= main_~lk11~0 1)} [305] L158-1-->L163-1: Formula: (= v_main_~p8~0_3 0) InVars {main_~p8~0=v_main_~p8~0_3} OutVars{main_~p8~0=v_main_~p8~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {799471#(= main_~lk11~0 1)} [309] L163-1-->L168-1: Formula: (= v_main_~p9~0_3 0) InVars {main_~p9~0=v_main_~p9~0_3} OutVars{main_~p9~0=v_main_~p9~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {799471#(= main_~lk11~0 1)} [313] L168-1-->L173-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {799471#(= main_~lk11~0 1)} [316] L173-1-->L179: Formula: (not (= v_main_~p11~0_2 0)) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[] {799471#(= main_~lk11~0 1)} is VALID [2022-04-27 20:40:00,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {799471#(= main_~lk11~0 1)} [318] L179-->L184-1: Formula: (not (= v_main_~lk11~0_3 1)) InVars {main_~lk11~0=v_main_~lk11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_3} AuxVars[] AssignedVars[] {799467#false} is VALID [2022-04-27 20:40:00,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {799467#false} [280] L184-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799467#false} is VALID [2022-04-27 20:40:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:40:00,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:40:00,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997629775] [2022-04-27 20:40:00,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997629775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:40:00,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:40:00,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:40:00,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398009859] [2022-04-27 20:40:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:40:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 20:40:00,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:40:00,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:40:00,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:40:00,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:40:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:40:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:40:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:40:00,101 INFO L87 Difference]: Start difference. First operand 34825 states and 41991 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:42:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:42:16,393 INFO L93 Difference]: Finished difference Result 57355 states and 68616 transitions. [2022-04-27 20:42:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:42:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 20:42:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:42:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:42:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 20:42:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:42:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 20:42:16,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-27 20:42:16,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:44:01,549 INFO L225 Difference]: With dead ends: 57355 [2022-04-27 20:44:01,549 INFO L226 Difference]: Without dead ends: 57355 [2022-04-27 20:44:01,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:44:01,550 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:44:01,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:44:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57355 states. [2022-04-27 20:44:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57355 to 53257. [2022-04-27 20:44:01,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:44:02,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57355 states. Second operand has 53257 states, 53253 states have (on average 1.1730418943533698) internal successors, (62468), 53253 states have internal predecessors, (62468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:44:02,086 INFO L74 IsIncluded]: Start isIncluded. First operand 57355 states. Second operand has 53257 states, 53253 states have (on average 1.1730418943533698) internal successors, (62468), 53253 states have internal predecessors, (62468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 20:44:02,127 INFO L87 Difference]: Start difference. First operand 57355 states. Second operand has 53257 states, 53253 states have (on average 1.1730418943533698) internal successors, (62468), 53253 states have internal predecessors, (62468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)