/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-e106359-m [2022-04-14 23:27:24,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:27:24,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:27:24,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:27:24,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:27:24,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:27:24,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:27:24,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:27:24,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:27:24,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:27:24,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:27:24,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:27:24,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:27:24,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:27:24,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:27:24,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:27:24,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:27:24,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:27:24,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:27:24,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:27:24,400 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:27:24,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:27:24,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:27:24,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:27:24,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:27:24,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:27:24,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:27:24,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:27:24,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:27:24,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:27:24,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:27:24,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:27:24,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:27:24,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:27:24,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:27:24,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:27:24,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:27:24,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:27:24,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:27:24,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:27:24,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:27:24,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:27:24,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 23:27:24,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:27:24,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:27:24,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:27:24,424 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:27:24,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:27:24,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:27:24,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:27:24,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:27:24,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:27:24,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:27:24,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:27:24,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:27:24,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:24,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:27:24,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:27:24,427 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:27:24,427 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-14 23:27:24,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:27:24,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:27:24,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:27:24,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:27:24,612 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:27:24,612 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-14 23:27:24,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4124806ce/d659c419f6294bebbd71a2731733d914/FLAGdd343ca66 [2022-04-14 23:27:25,072 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:27:25,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-14 23:27:25,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4124806ce/d659c419f6294bebbd71a2731733d914/FLAGdd343ca66 [2022-04-14 23:27:25,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4124806ce/d659c419f6294bebbd71a2731733d914 [2022-04-14 23:27:25,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:27:25,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:27:25,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:25,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:27:25,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:27:25,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7076493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25, skipping insertion in model container [2022-04-14 23:27:25,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:27:25,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:27:25,291 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-14 23:27:25,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:25,306 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:27:25,338 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-14 23:27:25,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:25,349 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:27:25,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25 WrapperNode [2022-04-14 23:27:25,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:25,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:27:25,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:27:25,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:27:25,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:27:25,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:27:25,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:27:25,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:27:25,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:27:25,428 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-14 23:27:25,446 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-14 23:27:25,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:27:25,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:27:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:27:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:27:25,502 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:27:25,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:27:25,670 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:27:25,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:27:25,677 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:27:25,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:25 BoogieIcfgContainer [2022-04-14 23:27:25,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:27:25,679 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:27:25,679 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:27:25,679 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:27:25,682 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:25" (1/1) ... [2022-04-14 23:27:25,683 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:27:25,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:25 BasicIcfg [2022-04-14 23:27:25,716 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:27:25,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:27:25,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:27:25,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:27:25,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:27:25" (1/4) ... [2022-04-14 23:27:25,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aea303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:25, skipping insertion in model container [2022-04-14 23:27:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:25" (2/4) ... [2022-04-14 23:27:25,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aea303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:25, skipping insertion in model container [2022-04-14 23:27:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:25" (3/4) ... [2022-04-14 23:27:25,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19aea303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:27:25, skipping insertion in model container [2022-04-14 23:27:25,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:25" (4/4) ... [2022-04-14 23:27:25,721 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.cJordan [2022-04-14 23:27:25,724 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:27:25,724 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:27:25,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:27:25,764 INFO L340 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 [2022-04-14 23:27:25,764 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:27:25,776 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-14 23:27:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:27:25,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:25,786 INFO L499 BasicCegarLoop]: 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-14 23:27:25,786 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1823990193, now seen corresponding path program 1 times [2022-04-14 23:27:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:25,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282682626] [2022-04-14 23:27:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,058 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-14 23:27:26,058 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-14 23:27:26,058 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-14 23:27:26,062 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-14 23:27:26,062 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-14 23:27:26,062 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-14 23:27:26,062 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-14 23:27:26,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-14 23:27:26,063 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-14 23:27:26,063 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-14 23:27:26,063 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-14 23:27:26,066 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-14 23:27:26,067 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-14 23:27:26,068 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-14 23:27:26,068 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-14 23:27:26,069 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-14 23:27:26,069 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-14 23:27:26,070 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-14 23:27:26,072 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-14 23:27:26,073 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-14 23:27:26,073 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-14 23:27:26,074 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-14 23:27:26,079 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-14 23:27:26,080 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-14 23:27:26,081 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-14 23:27:26,081 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-14 23:27:26,081 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-14 23:27:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282682626] [2022-04-14 23:27:26,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282682626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:26,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:26,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001757719] [2022-04-14 23:27:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:26,087 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-14 23:27:26,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:26,090 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-14 23:27:26,111 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-14 23:27:26,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:26,128 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-14 23:27:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:26,485 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2022-04-14 23:27:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:26,485 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-14 23:27:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:26,486 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-14 23:27:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-14 23:27:26,493 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-14 23:27:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-14 23:27:26,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-14 23:27:26,633 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-14 23:27:26,645 INFO L225 Difference]: With dead ends: 93 [2022-04-14 23:27:26,646 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 23:27:26,647 INFO L912 BasicCegarLoop]: 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-14 23:27:26,652 INFO L913 BasicCegarLoop]: 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-14 23:27:26,653 INFO L914 BasicCegarLoop]: 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-14 23:27:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 23:27:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-14 23:27:26,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:26,677 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-14 23:27:26,678 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-14 23:27:26,678 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-14 23:27:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:26,682 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-14 23:27:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-14 23:27:26,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:26,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:26,683 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-14 23:27:26,684 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-14 23:27:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:26,687 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-14 23:27:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-14 23:27:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:26,689 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-14 23:27:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-14 23:27:26,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-14 23:27:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:26,691 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-14 23:27:26,692 INFO L479 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-14 23:27:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-14 23:27:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:27:26,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:26,692 INFO L499 BasicCegarLoop]: 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-14 23:27:26,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:27:26,693 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash -316438384, now seen corresponding path program 1 times [2022-04-14 23:27:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:26,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181743234] [2022-04-14 23:27:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,775 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-14 23:27:26,776 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-14 23:27:26,776 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-14 23:27:26,776 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-14 23:27:26,777 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-14 23:27:26,777 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-14 23:27:26,777 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-14 23:27:26,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {388#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 23:27:26,777 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-14 23:27:26,777 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-14 23:27:26,777 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-14 23:27:26,778 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-14 23:27:26,778 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-14 23:27:26,779 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-14 23:27:26,779 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-14 23:27:26,779 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-14 23:27:26,780 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-14 23:27:26,780 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-14 23:27:26,780 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-14 23:27:26,781 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-14 23:27:26,781 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-14 23:27:26,781 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-14 23:27:26,782 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-14 23:27:26,782 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-14 23:27:26,782 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-14 23:27:26,782 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-14 23:27:26,783 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-14 23:27:26,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181743234] [2022-04-14 23:27:26,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181743234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:26,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:26,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985764366] [2022-04-14 23:27:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:26,784 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-14 23:27:26,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:26,785 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-14 23:27:26,799 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-14 23:27:26,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:26,801 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-14 23:27:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:26,966 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-14 23:27:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:26,966 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-14 23:27:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:26,966 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-14 23:27:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-14 23:27:26,968 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-14 23:27:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-14 23:27:26,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-14 23:27:27,081 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-14 23:27:27,083 INFO L225 Difference]: With dead ends: 85 [2022-04-14 23:27:27,083 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 23:27:27,083 INFO L912 BasicCegarLoop]: 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-14 23:27:27,084 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:27,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 23:27:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-14 23:27:27,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:27,089 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-14 23:27:27,089 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-14 23:27:27,089 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-14 23:27:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,092 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-14 23:27:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-14 23:27:27,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,093 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-14 23:27:27,093 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-14 23:27:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,095 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-14 23:27:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-14 23:27:27,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:27,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:27,096 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-14 23:27:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-14 23:27:27,098 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-14 23:27:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:27,098 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-14 23:27:27,098 INFO L479 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-14 23:27:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-14 23:27:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:27,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:27,099 INFO L499 BasicCegarLoop]: 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-14 23:27:27,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:27:27,099 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:27,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -709089080, now seen corresponding path program 1 times [2022-04-14 23:27:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:27,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763574089] [2022-04-14 23:27:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,144 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-14 23:27:27,144 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-14 23:27:27,144 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-14 23:27:27,145 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-14 23:27:27,145 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-14 23:27:27,145 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-14 23:27:27,145 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-14 23:27:27,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-14 23:27:27,145 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-14 23:27:27,146 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-14 23:27:27,146 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-14 23:27:27,146 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-14 23:27:27,146 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-14 23:27:27,147 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-14 23:27:27,147 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-14 23:27:27,147 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-14 23:27:27,148 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-14 23:27:27,148 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-14 23:27:27,148 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-14 23:27:27,149 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-14 23:27:27,149 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-14 23:27:27,149 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-14 23:27:27,150 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-14 23:27:27,150 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-14 23:27:27,150 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-14 23:27:27,150 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-14 23:27:27,151 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-14 23:27:27,151 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-14 23:27:27,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:27,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763574089] [2022-04-14 23:27:27,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763574089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:27,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:27,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323100774] [2022-04-14 23:27:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:27,152 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-14 23:27:27,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:27,152 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-14 23:27:27,165 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-14 23:27:27,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:27,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:27,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:27,166 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-14 23:27:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,346 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-14 23:27:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:27,346 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-14 23:27:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:27,346 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-14 23:27:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-14 23:27:27,348 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-14 23:27:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-14 23:27:27,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 152 transitions. [2022-04-14 23:27:27,465 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-14 23:27:27,466 INFO L225 Difference]: With dead ends: 88 [2022-04-14 23:27:27,466 INFO L226 Difference]: Without dead ends: 88 [2022-04-14 23:27:27,466 INFO L912 BasicCegarLoop]: 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-14 23:27:27,467 INFO L913 BasicCegarLoop]: 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-14 23:27:27,467 INFO L914 BasicCegarLoop]: 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-14 23:27:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-14 23:27:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-14 23:27:27,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:27,471 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-14 23:27:27,471 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-14 23:27:27,471 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-14 23:27:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,473 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-14 23:27:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-14 23:27:27,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,474 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-14 23:27:27,474 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-14 23:27:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,477 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-14 23:27:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-14 23:27:27,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:27,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:27,478 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-14 23:27:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-14 23:27:27,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-14 23:27:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:27,481 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-14 23:27:27,481 INFO L479 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-14 23:27:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-14 23:27:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:27,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:27,481 INFO L499 BasicCegarLoop]: 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-14 23:27:27,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:27:27,481 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1219623257, now seen corresponding path program 1 times [2022-04-14 23:27:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:27,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486176299] [2022-04-14 23:27:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,524 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-14 23:27:27,524 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-14 23:27:27,524 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-14 23:27:27,525 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-14 23:27:27,525 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-14 23:27:27,525 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-14 23:27:27,525 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-14 23:27:27,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1100#true} is VALID [2022-04-14 23:27:27,526 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-14 23:27:27,526 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-14 23:27:27,526 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-14 23:27:27,526 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-14 23:27:27,526 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-14 23:27:27,527 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-14 23:27:27,527 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-14 23:27:27,527 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-14 23:27:27,528 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-14 23:27:27,528 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-14 23:27:27,528 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-14 23:27:27,529 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-14 23:27:27,529 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-14 23:27:27,529 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-14 23:27:27,530 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-14 23:27:27,530 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-14 23:27:27,530 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-14 23:27:27,531 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-14 23:27:27,531 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-14 23:27:27,531 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-14 23:27:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:27,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486176299] [2022-04-14 23:27:27,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486176299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:27,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:27,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178274182] [2022-04-14 23:27:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:27,538 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-14 23:27:27,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:27,539 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-14 23:27:27,552 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-14 23:27:27,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:27,553 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-14 23:27:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,729 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-14 23:27:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:27,730 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-14 23:27:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:27,730 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-14 23:27:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:27,731 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-14 23:27:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:27,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-14 23:27:27,844 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-14 23:27:27,846 INFO L225 Difference]: With dead ends: 159 [2022-04-14 23:27:27,847 INFO L226 Difference]: Without dead ends: 159 [2022-04-14 23:27:27,847 INFO L912 BasicCegarLoop]: 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-14 23:27:27,848 INFO L913 BasicCegarLoop]: 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-14 23:27:27,848 INFO L914 BasicCegarLoop]: 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-14 23:27:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-14 23:27:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2022-04-14 23:27:27,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:27,851 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-14 23:27:27,852 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-14 23:27:27,852 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-14 23:27:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,856 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-14 23:27:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-14 23:27:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,857 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-14 23:27:27,857 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-14 23:27:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,861 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2022-04-14 23:27:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-04-14 23:27:27,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:27,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:27,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:27,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:27,862 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-14 23:27:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 201 transitions. [2022-04-14 23:27:27,864 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 201 transitions. Word has length 24 [2022-04-14 23:27:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:27,864 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 201 transitions. [2022-04-14 23:27:27,864 INFO L479 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-14 23:27:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 201 transitions. [2022-04-14 23:27:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:27,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:27,865 INFO L499 BasicCegarLoop]: 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-14 23:27:27,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:27:27,865 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash 287928552, now seen corresponding path program 1 times [2022-04-14 23:27:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:27,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367396591] [2022-04-14 23:27:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,904 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-14 23:27:27,905 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-14 23:27:27,905 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-14 23:27:27,905 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-14 23:27:27,905 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-14 23:27:27,905 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-14 23:27:27,906 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-14 23:27:27,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {1702#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1702#true} is VALID [2022-04-14 23:27:27,906 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-14 23:27:27,906 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-14 23:27:27,906 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-14 23:27:27,906 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-14 23:27:27,907 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-14 23:27:27,907 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-14 23:27:27,907 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-14 23:27:27,907 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-14 23:27:27,908 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-14 23:27:27,908 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-14 23:27:27,908 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-14 23:27:27,909 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-14 23:27:27,909 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-14 23:27:27,909 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-14 23:27:27,910 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-14 23:27:27,910 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-14 23:27:27,910 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-14 23:27:27,910 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-14 23:27:27,910 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-14 23:27:27,911 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-14 23:27:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:27,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367396591] [2022-04-14 23:27:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367396591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94894600] [2022-04-14 23:27:27,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:27,911 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-14 23:27:27,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:27,912 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-14 23:27:27,925 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-14 23:27:27,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:27,926 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-14 23:27:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,105 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-14 23:27:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:28,105 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-14 23:27:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:28,105 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-14 23:27:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-14 23:27:28,107 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-14 23:27:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-14 23:27:28,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-14 23:27:28,216 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-14 23:27:28,218 INFO L225 Difference]: With dead ends: 161 [2022-04-14 23:27:28,218 INFO L226 Difference]: Without dead ends: 161 [2022-04-14 23:27:28,218 INFO L912 BasicCegarLoop]: 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-14 23:27:28,218 INFO L913 BasicCegarLoop]: 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-14 23:27:28,219 INFO L914 BasicCegarLoop]: 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-14 23:27:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-14 23:27:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-14 23:27:28,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:28,223 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-14 23:27:28,224 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-14 23:27:28,224 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-14 23:27:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,227 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-14 23:27:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-14 23:27:28,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,228 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-14 23:27:28,228 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-14 23:27:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,231 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2022-04-14 23:27:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 284 transitions. [2022-04-14 23:27:28,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:28,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:28,232 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-14 23:27:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-14 23:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-14 23:27:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:28,236 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-14 23:27:28,236 INFO L479 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-14 23:27:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-14 23:27:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:28,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:28,237 INFO L499 BasicCegarLoop]: 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-14 23:27:28,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:27:28,237 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 846416876, now seen corresponding path program 1 times [2022-04-14 23:27:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:28,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251289182] [2022-04-14 23:27:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,271 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-14 23:27:28,271 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-14 23:27:28,272 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-14 23:27:28,272 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-14 23:27:28,272 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-14 23:27:28,272 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-14 23:27:28,272 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-14 23:27:28,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {2356#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#true} is VALID [2022-04-14 23:27:28,273 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-14 23:27:28,273 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-14 23:27:28,273 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-14 23:27:28,273 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-14 23:27:28,273 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-14 23:27:28,274 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-14 23:27:28,274 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-14 23:27:28,274 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-14 23:27:28,275 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-14 23:27:28,276 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-14 23:27:28,276 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-14 23:27:28,276 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-14 23:27:28,277 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-14 23:27:28,277 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-14 23:27:28,277 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-14 23:27:28,277 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-14 23:27:28,278 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-14 23:27:28,278 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-14 23:27:28,278 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-14 23:27:28,278 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-14 23:27:28,278 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-14 23:27:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:28,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251289182] [2022-04-14 23:27:28,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251289182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:28,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:28,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577499878] [2022-04-14 23:27:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:28,279 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-14 23:27:28,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:28,279 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-14 23:27:28,292 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-14 23:27:28,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:28,293 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-14 23:27:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,466 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-14 23:27:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:28,466 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-14 23:27:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:28,467 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-14 23:27:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:28,468 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-14 23:27:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:28,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-14 23:27:28,578 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-14 23:27:28,580 INFO L225 Difference]: With dead ends: 163 [2022-04-14 23:27:28,581 INFO L226 Difference]: Without dead ends: 163 [2022-04-14 23:27:28,581 INFO L912 BasicCegarLoop]: 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-14 23:27:28,581 INFO L913 BasicCegarLoop]: 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-14 23:27:28,582 INFO L914 BasicCegarLoop]: 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-14 23:27:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-14 23:27:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2022-04-14 23:27:28,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:28,597 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-14 23:27:28,597 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-14 23:27:28,597 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-14 23:27:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,601 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-14 23:27:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-14 23:27:28,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,601 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-14 23:27:28,601 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-14 23:27:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,611 INFO L93 Difference]: Finished difference Result 163 states and 284 transitions. [2022-04-14 23:27:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 284 transitions. [2022-04-14 23:27:28,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:28,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:28,612 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-14 23:27:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 283 transitions. [2022-04-14 23:27:28,615 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 283 transitions. Word has length 25 [2022-04-14 23:27:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:28,615 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 283 transitions. [2022-04-14 23:27:28,617 INFO L479 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-14 23:27:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 283 transitions. [2022-04-14 23:27:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:28,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:28,618 INFO L499 BasicCegarLoop]: 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-14 23:27:28,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:27:28,620 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash 335882699, now seen corresponding path program 1 times [2022-04-14 23:27:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:28,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978736069] [2022-04-14 23:27:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,677 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-14 23:27:28,677 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-14 23:27:28,677 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-14 23:27:28,678 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-14 23:27:28,678 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-14 23:27:28,678 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-14 23:27:28,678 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-14 23:27:28,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {3018#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3018#true} is VALID [2022-04-14 23:27:28,678 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-14 23:27:28,679 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-14 23:27:28,679 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-14 23:27:28,679 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-14 23:27:28,679 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-14 23:27:28,679 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-14 23:27:28,679 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-14 23:27:28,680 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-14 23:27:28,680 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-14 23:27:28,680 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-14 23:27:28,681 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-14 23:27:28,681 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-14 23:27:28,681 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-14 23:27:28,682 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-14 23:27:28,682 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-14 23:27:28,682 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-14 23:27:28,682 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-14 23:27:28,683 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-14 23:27:28,683 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-14 23:27:28,683 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-14 23:27:28,683 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-14 23:27:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:28,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978736069] [2022-04-14 23:27:28,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978736069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:28,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:28,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479218063] [2022-04-14 23:27:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:28,684 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-14 23:27:28,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:28,684 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-14 23:27:28,698 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-14 23:27:28,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:28,699 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-14 23:27:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,850 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-14 23:27:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:28,851 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-14 23:27:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:28,851 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-14 23:27:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:28,852 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-14 23:27:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:28,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-14 23:27:28,943 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-14 23:27:28,947 INFO L225 Difference]: With dead ends: 299 [2022-04-14 23:27:28,947 INFO L226 Difference]: Without dead ends: 299 [2022-04-14 23:27:28,948 INFO L912 BasicCegarLoop]: 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-14 23:27:28,948 INFO L913 BasicCegarLoop]: 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-14 23:27:28,949 INFO L914 BasicCegarLoop]: 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-14 23:27:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-14 23:27:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2022-04-14 23:27:28,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:28,953 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-14 23:27:28,953 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-14 23:27:28,954 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-14 23:27:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,961 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-14 23:27:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-14 23:27:28,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,963 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-14 23:27:28,963 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-14 23:27:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,969 INFO L93 Difference]: Finished difference Result 299 states and 532 transitions. [2022-04-14 23:27:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 532 transitions. [2022-04-14 23:27:28,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:28,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:28,970 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-14 23:27:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 379 transitions. [2022-04-14 23:27:28,974 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 379 transitions. Word has length 25 [2022-04-14 23:27:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:28,974 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 379 transitions. [2022-04-14 23:27:28,975 INFO L479 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-14 23:27:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 379 transitions. [2022-04-14 23:27:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:28,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:28,975 INFO L499 BasicCegarLoop]: 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-14 23:27:28,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:27:28,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1843434508, now seen corresponding path program 1 times [2022-04-14 23:27:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718841685] [2022-04-14 23:27:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,008 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-14 23:27:29,008 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-14 23:27:29,008 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-14 23:27:29,008 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-14 23:27:29,009 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-14 23:27:29,009 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-14 23:27:29,009 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-14 23:27:29,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {4144#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4144#true} is VALID [2022-04-14 23:27:29,009 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-14 23:27:29,009 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-14 23:27:29,009 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-14 23:27:29,009 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-14 23:27:29,010 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-14 23:27:29,010 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-14 23:27:29,010 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-14 23:27:29,010 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-14 23:27:29,011 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-14 23:27:29,011 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-14 23:27:29,011 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-14 23:27:29,012 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-14 23:27:29,012 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-14 23:27:29,012 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-14 23:27:29,013 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-14 23:27:29,013 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-14 23:27:29,013 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-14 23:27:29,013 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-14 23:27:29,014 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-14 23:27:29,014 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-14 23:27:29,014 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-14 23:27:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718841685] [2022-04-14 23:27:29,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718841685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268606107] [2022-04-14 23:27:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,015 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-14 23:27:29,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,015 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-14 23:27:29,028 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-14 23:27:29,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,029 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-14 23:27:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,195 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-14 23:27:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:29,196 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-14 23:27:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:29,196 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-14 23:27:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-14 23:27:29,198 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-14 23:27:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-14 23:27:29,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 149 transitions. [2022-04-14 23:27:29,290 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-14 23:27:29,294 INFO L225 Difference]: With dead ends: 307 [2022-04-14 23:27:29,295 INFO L226 Difference]: Without dead ends: 307 [2022-04-14 23:27:29,296 INFO L912 BasicCegarLoop]: 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-14 23:27:29,298 INFO L913 BasicCegarLoop]: 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-14 23:27:29,300 INFO L914 BasicCegarLoop]: 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-14 23:27:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-14 23:27:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-14 23:27:29,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,309 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-14 23:27:29,310 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-14 23:27:29,311 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-14 23:27:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,316 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-14 23:27:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-14 23:27:29,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,317 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-14 23:27:29,317 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-14 23:27:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,323 INFO L93 Difference]: Finished difference Result 307 states and 532 transitions. [2022-04-14 23:27:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 532 transitions. [2022-04-14 23:27:29,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,324 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-14 23:27:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 531 transitions. [2022-04-14 23:27:29,329 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 531 transitions. Word has length 25 [2022-04-14 23:27:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,329 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 531 transitions. [2022-04-14 23:27:29,329 INFO L479 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-14 23:27:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 531 transitions. [2022-04-14 23:27:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:29,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,331 INFO L499 BasicCegarLoop]: 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-14 23:27:29,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:27:29,331 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1822461380, now seen corresponding path program 1 times [2022-04-14 23:27:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687226181] [2022-04-14 23:27:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,370 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-14 23:27:29,370 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-14 23:27:29,370 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-14 23:27:29,371 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-14 23:27:29,371 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-14 23:27:29,371 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-14 23:27:29,371 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-14 23:27:29,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {5382#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5382#true} is VALID [2022-04-14 23:27:29,371 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-14 23:27:29,372 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-14 23:27:29,372 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-14 23:27:29,372 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-14 23:27:29,372 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-14 23:27:29,372 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-14 23:27:29,373 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-14 23:27:29,373 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-14 23:27:29,373 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-14 23:27:29,373 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-14 23:27:29,374 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-14 23:27:29,374 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-14 23:27:29,374 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-14 23:27:29,375 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-14 23:27:29,375 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-14 23:27:29,375 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-14 23:27:29,375 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-14 23:27:29,376 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-14 23:27:29,376 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-14 23:27:29,376 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-14 23:27:29,376 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-14 23:27:29,376 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-14 23:27:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687226181] [2022-04-14 23:27:29,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687226181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077188274] [2022-04-14 23:27:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,377 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-14 23:27:29,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,377 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-14 23:27:29,391 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-14 23:27:29,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,392 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-14 23:27:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,554 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-14 23:27:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:29,555 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-14 23:27:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:29,555 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-14 23:27:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-14 23:27:29,556 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-14 23:27:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-14 23:27:29,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-14 23:27:29,660 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-14 23:27:29,667 INFO L225 Difference]: With dead ends: 311 [2022-04-14 23:27:29,667 INFO L226 Difference]: Without dead ends: 311 [2022-04-14 23:27:29,667 INFO L912 BasicCegarLoop]: 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-14 23:27:29,668 INFO L913 BasicCegarLoop]: 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-14 23:27:29,669 INFO L914 BasicCegarLoop]: 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-14 23:27:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-14 23:27:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-14 23:27:29,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,676 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-14 23:27:29,676 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-14 23:27:29,677 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-14 23:27:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,682 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-14 23:27:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-14 23:27:29,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,683 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-14 23:27:29,685 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-14 23:27:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,693 INFO L93 Difference]: Finished difference Result 311 states and 532 transitions. [2022-04-14 23:27:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 532 transitions. [2022-04-14 23:27:29,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,694 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-14 23:27:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 531 transitions. [2022-04-14 23:27:29,701 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 531 transitions. Word has length 26 [2022-04-14 23:27:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,701 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 531 transitions. [2022-04-14 23:27:29,702 INFO L479 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-14 23:27:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 531 transitions. [2022-04-14 23:27:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:29,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,702 INFO L499 BasicCegarLoop]: 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-14 23:27:29,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:27:29,702 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1311927203, now seen corresponding path program 1 times [2022-04-14 23:27:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050252094] [2022-04-14 23:27:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,754 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-14 23:27:29,755 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-14 23:27:29,755 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-14 23:27:29,757 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-14 23:27:29,757 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-14 23:27:29,757 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-14 23:27:29,759 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-14 23:27:29,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {6636#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6636#true} is VALID [2022-04-14 23:27:29,762 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-14 23:27:29,762 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-14 23:27:29,762 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-14 23:27:29,762 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-14 23:27:29,762 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-14 23:27:29,762 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-14 23:27:29,764 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-14 23:27:29,765 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-14 23:27:29,765 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-14 23:27:29,765 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-14 23:27:29,766 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-14 23:27:29,766 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-14 23:27:29,766 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-14 23:27:29,766 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-14 23:27:29,767 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-14 23:27:29,767 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-14 23:27:29,767 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-14 23:27:29,767 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-14 23:27:29,768 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-14 23:27:29,768 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-14 23:27:29,768 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-14 23:27:29,768 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-14 23:27:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050252094] [2022-04-14 23:27:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050252094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158504759] [2022-04-14 23:27:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,769 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-14 23:27:29,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,769 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-14 23:27:29,783 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-14 23:27:29,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,784 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-14 23:27:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,934 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-14 23:27:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:29,934 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-14 23:27:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:29,934 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-14 23:27:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:29,937 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-14 23:27:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:29,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-14 23:27:30,021 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-14 23:27:30,032 INFO L225 Difference]: With dead ends: 571 [2022-04-14 23:27:30,032 INFO L226 Difference]: Without dead ends: 571 [2022-04-14 23:27:30,032 INFO L912 BasicCegarLoop]: 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-14 23:27:30,033 INFO L913 BasicCegarLoop]: 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-14 23:27:30,033 INFO L914 BasicCegarLoop]: 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-14 23:27:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-14 23:27:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-14 23:27:30,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,041 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-14 23:27:30,041 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-14 23:27:30,043 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-14 23:27:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,056 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-14 23:27:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-14 23:27:30,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,057 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-14 23:27:30,058 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-14 23:27:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,071 INFO L93 Difference]: Finished difference Result 571 states and 992 transitions. [2022-04-14 23:27:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 992 transitions. [2022-04-14 23:27:30,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:30,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:30,072 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-14 23:27:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 719 transitions. [2022-04-14 23:27:30,081 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 719 transitions. Word has length 26 [2022-04-14 23:27:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:30,081 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 719 transitions. [2022-04-14 23:27:30,081 INFO L479 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-14 23:27:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 719 transitions. [2022-04-14 23:27:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:30,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:30,082 INFO L499 BasicCegarLoop]: 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-14 23:27:30,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:27:30,083 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1475488284, now seen corresponding path program 1 times [2022-04-14 23:27:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896733951] [2022-04-14 23:27:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,127 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-14 23:27:30,127 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-14 23:27:30,127 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-14 23:27:30,129 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {8786#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8786#true} is VALID [2022-04-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,130 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-14 23:27:30,131 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-14 23:27:30,131 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-14 23:27:30,131 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-14 23:27:30,131 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-14 23:27:30,132 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-14 23:27:30,132 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-14 23:27:30,132 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-14 23:27:30,133 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-14 23:27:30,133 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-14 23:27:30,133 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-14 23:27:30,134 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-14 23:27:30,134 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-14 23:27:30,134 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-14 23:27:30,134 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-14 23:27:30,135 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-14 23:27:30,135 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-14 23:27:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:30,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896733951] [2022-04-14 23:27:30,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896733951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:30,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:30,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448842635] [2022-04-14 23:27:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:30,136 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-14 23:27:30,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:30,137 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-14 23:27:30,150 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-14 23:27:30,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,151 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-14 23:27:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,309 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-14 23:27:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,309 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-14 23:27:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,310 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-14 23:27:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-14 23:27:30,311 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-14 23:27:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-14 23:27:30,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-14 23:27:30,407 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-14 23:27:30,419 INFO L225 Difference]: With dead ends: 595 [2022-04-14 23:27:30,419 INFO L226 Difference]: Without dead ends: 595 [2022-04-14 23:27:30,419 INFO L912 BasicCegarLoop]: 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-14 23:27:30,419 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:30,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-14 23:27:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-14 23:27:30,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,438 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-14 23:27:30,440 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-14 23:27:30,441 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-14 23:27:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,456 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-14 23:27:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-14 23:27:30,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,458 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-14 23:27:30,459 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-14 23:27:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,473 INFO L93 Difference]: Finished difference Result 595 states and 1000 transitions. [2022-04-14 23:27:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1000 transitions. [2022-04-14 23:27:30,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:30,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:30,474 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-14 23:27:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 999 transitions. [2022-04-14 23:27:30,488 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 999 transitions. Word has length 26 [2022-04-14 23:27:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:30,488 INFO L478 AbstractCegarLoop]: Abstraction has 593 states and 999 transitions. [2022-04-14 23:27:30,488 INFO L479 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-14 23:27:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 999 transitions. [2022-04-14 23:27:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:30,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:30,489 INFO L499 BasicCegarLoop]: 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-14 23:27:30,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:27:30,489 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2015070056, now seen corresponding path program 1 times [2022-04-14 23:27:30,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:30,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627981143] [2022-04-14 23:27:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:30,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,528 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-14 23:27:30,528 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-14 23:27:30,528 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-14 23:27:30,528 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-14 23:27:30,528 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {11176#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11176#true} is VALID [2022-04-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,529 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-14 23:27:30,530 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-14 23:27:30,530 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-14 23:27:30,530 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-14 23:27:30,531 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-14 23:27:30,531 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-14 23:27:30,531 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-14 23:27:30,531 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-14 23:27:30,532 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-14 23:27:30,532 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-14 23:27:30,532 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-14 23:27:30,532 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-14 23:27:30,533 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-14 23:27:30,533 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-14 23:27:30,533 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-14 23:27:30,533 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-14 23:27:30,533 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-14 23:27:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627981143] [2022-04-14 23:27:30,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627981143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:30,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:30,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929840279] [2022-04-14 23:27:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:30,534 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-14 23:27:30,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:30,534 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-14 23:27:30,548 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-14 23:27:30,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,549 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-14 23:27:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,718 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-14 23:27:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,718 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-14 23:27:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,718 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-14 23:27:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:30,720 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-14 23:27:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:30,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-14 23:27:30,808 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-14 23:27:30,820 INFO L225 Difference]: With dead ends: 603 [2022-04-14 23:27:30,820 INFO L226 Difference]: Without dead ends: 603 [2022-04-14 23:27:30,821 INFO L912 BasicCegarLoop]: 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-14 23:27:30,821 INFO L913 BasicCegarLoop]: 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-14 23:27:30,821 INFO L914 BasicCegarLoop]: 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-14 23:27:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-14 23:27:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-14 23:27:30,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,828 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-14 23:27:30,829 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-14 23:27:30,830 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-14 23:27:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,843 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-14 23:27:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-14 23:27:30,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,845 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-14 23:27:30,846 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-14 23:27:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,860 INFO L93 Difference]: Finished difference Result 603 states and 1000 transitions. [2022-04-14 23:27:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1000 transitions. [2022-04-14 23:27:30,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:30,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:30,862 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-14 23:27:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 999 transitions. [2022-04-14 23:27:30,876 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 999 transitions. Word has length 27 [2022-04-14 23:27:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:30,876 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 999 transitions. [2022-04-14 23:27:30,876 INFO L479 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-14 23:27:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 999 transitions. [2022-04-14 23:27:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:30,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:30,877 INFO L499 BasicCegarLoop]: 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-14 23:27:30,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:27:30,877 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1504535879, now seen corresponding path program 1 times [2022-04-14 23:27:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056189464] [2022-04-14 23:27:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,904 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-14 23:27:30,904 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-14 23:27:30,904 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {13598#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13598#true} is VALID [2022-04-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,905 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-14 23:27:30,906 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-14 23:27:30,908 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-14 23:27:30,909 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-14 23:27:30,909 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-14 23:27:30,909 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-14 23:27:30,909 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-14 23:27:30,910 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-14 23:27:30,910 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-14 23:27:30,910 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-14 23:27:30,911 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-14 23:27:30,911 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-14 23:27:30,911 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-14 23:27:30,912 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-14 23:27:30,912 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-14 23:27:30,912 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-14 23:27:30,912 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-14 23:27:30,912 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-14 23:27:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:30,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056189464] [2022-04-14 23:27:30,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056189464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:30,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:30,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081192928] [2022-04-14 23:27:30,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:30,913 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-14 23:27:30,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:30,913 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-14 23:27:30,927 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-14 23:27:30,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,928 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-14 23:27:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,105 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-14 23:27:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:31,105 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-14 23:27:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:31,105 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-14 23:27:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:31,106 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-14 23:27:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:31,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-14 23:27:31,189 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-14 23:27:31,225 INFO L225 Difference]: With dead ends: 1099 [2022-04-14 23:27:31,225 INFO L226 Difference]: Without dead ends: 1099 [2022-04-14 23:27:31,225 INFO L912 BasicCegarLoop]: 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-14 23:27:31,226 INFO L913 BasicCegarLoop]: 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-14 23:27:31,226 INFO L914 BasicCegarLoop]: 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-14 23:27:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-14 23:27:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-14 23:27:31,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:31,237 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-14 23:27:31,238 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-14 23:27:31,239 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-14 23:27:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,281 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-14 23:27:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-14 23:27:31,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,283 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-14 23:27:31,284 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-14 23:27:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,325 INFO L93 Difference]: Finished difference Result 1099 states and 1848 transitions. [2022-04-14 23:27:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1848 transitions. [2022-04-14 23:27:31,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,328 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-14 23:27:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1367 transitions. [2022-04-14 23:27:31,353 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1367 transitions. Word has length 27 [2022-04-14 23:27:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:31,353 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1367 transitions. [2022-04-14 23:27:31,353 INFO L479 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-14 23:27:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1367 transitions. [2022-04-14 23:27:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:31,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:31,354 INFO L499 BasicCegarLoop]: 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-14 23:27:31,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:27:31,354 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1282879608, now seen corresponding path program 1 times [2022-04-14 23:27:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:31,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213764786] [2022-04-14 23:27:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,386 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-14 23:27:31,387 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-14 23:27:31,387 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-14 23:27:31,387 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-14 23:27:31,387 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-14 23:27:31,387 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-14 23:27:31,387 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-14 23:27:31,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {17748#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17748#true} is VALID [2022-04-14 23:27:31,387 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-14 23:27:31,388 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-14 23:27:31,388 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-14 23:27:31,388 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-14 23:27:31,388 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-14 23:27:31,388 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-14 23:27:31,388 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-14 23:27:31,392 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-14 23:27:31,392 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-14 23:27:31,393 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-14 23:27:31,393 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-14 23:27:31,393 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-14 23:27:31,393 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-14 23:27:31,394 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-14 23:27:31,394 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-14 23:27:31,394 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-14 23:27:31,395 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-14 23:27:31,395 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-14 23:27:31,395 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-14 23:27:31,395 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-14 23:27:31,395 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-14 23:27:31,395 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-14 23:27:31,396 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-14 23:27:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:31,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213764786] [2022-04-14 23:27:31,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213764786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:31,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:31,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668414712] [2022-04-14 23:27:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:31,396 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-14 23:27:31,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:31,397 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-14 23:27:31,410 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-14 23:27:31,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:31,411 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-14 23:27:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,614 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-14 23:27:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:31,614 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-14 23:27:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:31,615 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-14 23:27:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-14 23:27:31,616 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-14 23:27:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-14 23:27:31,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-14 23:27:31,708 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-14 23:27:31,747 INFO L225 Difference]: With dead ends: 1163 [2022-04-14 23:27:31,748 INFO L226 Difference]: Without dead ends: 1163 [2022-04-14 23:27:31,748 INFO L912 BasicCegarLoop]: 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-14 23:27:31,748 INFO L913 BasicCegarLoop]: 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-14 23:27:31,748 INFO L914 BasicCegarLoop]: 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-14 23:27:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-14 23:27:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-14 23:27:31,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:31,763 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-14 23:27:31,765 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-14 23:27:31,766 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-14 23:27:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,810 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-14 23:27:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-14 23:27:31,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,813 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-14 23:27:31,814 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-14 23:27:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,856 INFO L93 Difference]: Finished difference Result 1163 states and 1880 transitions. [2022-04-14 23:27:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2022-04-14 23:27:31,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,859 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-14 23:27:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1879 transitions. [2022-04-14 23:27:31,901 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1879 transitions. Word has length 27 [2022-04-14 23:27:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:31,901 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1879 transitions. [2022-04-14 23:27:31,901 INFO L479 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-14 23:27:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1879 transitions. [2022-04-14 23:27:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:31,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:31,902 INFO L499 BasicCegarLoop]: 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-14 23:27:31,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:27:31,902 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash -603995456, now seen corresponding path program 1 times [2022-04-14 23:27:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:31,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038594268] [2022-04-14 23:27:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,935 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-14 23:27:31,935 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-14 23:27:31,935 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-14 23:27:31,936 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-14 23:27:31,936 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-14 23:27:31,936 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-14 23:27:31,936 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-14 23:27:31,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {22410#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22410#true} is VALID [2022-04-14 23:27:31,936 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-14 23:27:31,936 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-14 23:27:31,936 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-14 23:27:31,937 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-14 23:27:31,937 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-14 23:27:31,937 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-14 23:27:31,937 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-14 23:27:31,937 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-14 23:27:31,937 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-14 23:27:31,938 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-14 23:27:31,938 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-14 23:27:31,938 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-14 23:27:31,938 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-14 23:27:31,939 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-14 23:27:31,939 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-14 23:27:31,939 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-14 23:27:31,939 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-14 23:27:31,940 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-14 23:27:31,941 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-14 23:27:31,941 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-14 23:27:31,941 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-14 23:27:31,941 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-14 23:27:31,941 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-14 23:27:31,941 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-14 23:27:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038594268] [2022-04-14 23:27:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038594268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:31,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:31,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340709583] [2022-04-14 23:27:31,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:31,942 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-14 23:27:31,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:31,942 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-14 23:27:31,957 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-14 23:27:31,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:31,957 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-14 23:27:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,142 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-14 23:27:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:32,142 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-14 23:27:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:32,142 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-14 23:27:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-14 23:27:32,144 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-14 23:27:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-14 23:27:32,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-14 23:27:32,231 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-14 23:27:32,271 INFO L225 Difference]: With dead ends: 1179 [2022-04-14 23:27:32,271 INFO L226 Difference]: Without dead ends: 1179 [2022-04-14 23:27:32,271 INFO L912 BasicCegarLoop]: 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-14 23:27:32,272 INFO L913 BasicCegarLoop]: 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-14 23:27:32,272 INFO L914 BasicCegarLoop]: 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-14 23:27:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-14 23:27:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-14 23:27:32,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:32,285 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-14 23:27:32,286 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-14 23:27:32,288 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-14 23:27:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,330 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-14 23:27:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-14 23:27:32,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,334 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-14 23:27:32,335 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-14 23:27:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,379 INFO L93 Difference]: Finished difference Result 1179 states and 1880 transitions. [2022-04-14 23:27:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1880 transitions. [2022-04-14 23:27:32,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:32,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:32,383 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-14 23:27:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1879 transitions. [2022-04-14 23:27:32,428 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1879 transitions. Word has length 28 [2022-04-14 23:27:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:32,428 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1879 transitions. [2022-04-14 23:27:32,428 INFO L479 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-14 23:27:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1879 transitions. [2022-04-14 23:27:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:32,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:32,429 INFO L499 BasicCegarLoop]: 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-14 23:27:32,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:27:32,429 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1114529633, now seen corresponding path program 1 times [2022-04-14 23:27:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:32,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262692804] [2022-04-14 23:27:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,465 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-14 23:27:32,465 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-14 23:27:32,465 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {27136#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27136#true} is VALID [2022-04-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,466 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-14 23:27:32,467 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-14 23:27:32,467 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-14 23:27:32,467 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-14 23:27:32,467 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-14 23:27:32,467 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-14 23:27:32,468 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-14 23:27:32,468 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-14 23:27:32,468 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-14 23:27:32,468 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-14 23:27:32,469 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-14 23:27:32,469 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-14 23:27:32,469 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-14 23:27:32,469 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-14 23:27:32,470 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-14 23:27:32,470 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-14 23:27:32,470 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-14 23:27:32,470 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-14 23:27:32,470 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-14 23:27:32,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-14 23:27:32,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:32,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262692804] [2022-04-14 23:27:32,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262692804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:32,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:32,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032876276] [2022-04-14 23:27:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:32,471 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-14 23:27:32,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:32,472 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-14 23:27:32,488 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-14 23:27:32,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:32,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:32,489 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-14 23:27:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,776 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-14 23:27:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:32,776 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-14 23:27:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:32,776 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-14 23:27:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:27:32,777 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-14 23:27:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:27:32,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-14 23:27:32,858 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-14 23:27:32,986 INFO L225 Difference]: With dead ends: 2123 [2022-04-14 23:27:32,987 INFO L226 Difference]: Without dead ends: 2123 [2022-04-14 23:27:32,987 INFO L912 BasicCegarLoop]: 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-14 23:27:32,987 INFO L913 BasicCegarLoop]: 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-14 23:27:32,987 INFO L914 BasicCegarLoop]: 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-14 23:27:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-14 23:27:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-14 23:27:33,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:33,007 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-14 23:27:33,009 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-14 23:27:33,011 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-14 23:27:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,151 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-14 23:27:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-14 23:27:33,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,156 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-14 23:27:33,158 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-14 23:27:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,287 INFO L93 Difference]: Finished difference Result 2123 states and 3432 transitions. [2022-04-14 23:27:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3432 transitions. [2022-04-14 23:27:33,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:33,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:33,292 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-14 23:27:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2599 transitions. [2022-04-14 23:27:33,377 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2599 transitions. Word has length 28 [2022-04-14 23:27:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:33,377 INFO L478 AbstractCegarLoop]: Abstraction has 1673 states and 2599 transitions. [2022-04-14 23:27:33,377 INFO L479 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-14 23:27:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2599 transitions. [2022-04-14 23:27:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:33,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:33,379 INFO L499 BasicCegarLoop]: 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-14 23:27:33,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:27:33,379 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash 393022176, now seen corresponding path program 1 times [2022-04-14 23:27:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:33,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38029492] [2022-04-14 23:27:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,418 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-14 23:27:33,419 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-14 23:27:33,419 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-14 23:27:33,419 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-14 23:27:33,419 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-14 23:27:33,419 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-14 23:27:33,419 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-14 23:27:33,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {35190#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35190#true} is VALID [2022-04-14 23:27:33,419 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,420 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-14 23:27:33,421 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-14 23:27:33,421 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-14 23:27:33,421 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-14 23:27:33,421 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-14 23:27:33,422 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-14 23:27:33,422 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-14 23:27:33,422 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-14 23:27:33,422 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-14 23:27:33,423 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-14 23:27:33,423 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-14 23:27:33,423 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-14 23:27:33,423 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-14 23:27:33,424 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-14 23:27:33,424 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-14 23:27:33,424 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-14 23:27:33,424 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-14 23:27:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38029492] [2022-04-14 23:27:33,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38029492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:33,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93929685] [2022-04-14 23:27:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:33,425 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-14 23:27:33,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:33,425 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-14 23:27:33,441 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-14 23:27:33,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:33,441 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-14 23:27:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,756 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-14 23:27:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:33,757 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-14 23:27:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:33,757 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-14 23:27:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-14 23:27:33,758 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-14 23:27:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-14 23:27:33,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-14 23:27:33,861 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-14 23:27:34,002 INFO L225 Difference]: With dead ends: 2283 [2022-04-14 23:27:34,002 INFO L226 Difference]: Without dead ends: 2283 [2022-04-14 23:27:34,003 INFO L912 BasicCegarLoop]: 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-14 23:27:34,003 INFO L913 BasicCegarLoop]: 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-14 23:27:34,003 INFO L914 BasicCegarLoop]: 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-14 23:27:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-14 23:27:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-14 23:27:34,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:34,030 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-14 23:27:34,031 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-14 23:27:34,033 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-14 23:27:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,178 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-14 23:27:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-14 23:27:34,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:34,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:34,183 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-14 23:27:34,185 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-14 23:27:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,351 INFO L93 Difference]: Finished difference Result 2283 states and 3528 transitions. [2022-04-14 23:27:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3528 transitions. [2022-04-14 23:27:34,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:34,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:34,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:34,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:34,356 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-14 23:27:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3527 transitions. [2022-04-14 23:27:34,503 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3527 transitions. Word has length 28 [2022-04-14 23:27:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:34,504 INFO L478 AbstractCegarLoop]: Abstraction has 2281 states and 3527 transitions. [2022-04-14 23:27:34,504 INFO L479 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-14 23:27:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3527 transitions. [2022-04-14 23:27:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:34,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:34,505 INFO L499 BasicCegarLoop]: 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-14 23:27:34,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:27:34,505 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:34,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash -190647580, now seen corresponding path program 1 times [2022-04-14 23:27:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:34,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852990398] [2022-04-14 23:27:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:34,532 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-14 23:27:34,532 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-14 23:27:34,532 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {44332#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44332#true} is VALID [2022-04-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,533 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-14 23:27:34,535 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-14 23:27:34,536 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-14 23:27:34,536 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-14 23:27:34,536 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-14 23:27:34,537 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-14 23:27:34,537 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-14 23:27:34,537 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-14 23:27:34,537 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-14 23:27:34,538 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-14 23:27:34,538 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-14 23:27:34,538 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-14 23:27:34,538 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-14 23:27:34,539 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-14 23:27:34,539 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-14 23:27:34,539 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-14 23:27:34,539 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-14 23:27:34,539 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-14 23:27:34,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:34,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852990398] [2022-04-14 23:27:34,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852990398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:34,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:34,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279831353] [2022-04-14 23:27:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:34,540 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-14 23:27:34,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:34,540 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-14 23:27:34,555 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-14 23:27:34,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:34,556 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-14 23:27:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,864 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-14 23:27:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:34,864 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-14 23:27:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:34,864 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-14 23:27:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:34,865 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-14 23:27:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:34,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-14 23:27:34,965 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-14 23:27:35,108 INFO L225 Difference]: With dead ends: 2315 [2022-04-14 23:27:35,109 INFO L226 Difference]: Without dead ends: 2315 [2022-04-14 23:27:35,109 INFO L912 BasicCegarLoop]: 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-14 23:27:35,109 INFO L913 BasicCegarLoop]: 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-14 23:27:35,109 INFO L914 BasicCegarLoop]: 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-14 23:27:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-14 23:27:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-14 23:27:35,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:35,134 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-14 23:27:35,135 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-14 23:27:35,137 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-14 23:27:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:35,287 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-14 23:27:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-14 23:27:35,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:35,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:35,292 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-14 23:27:35,294 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-14 23:27:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:35,445 INFO L93 Difference]: Finished difference Result 2315 states and 3528 transitions. [2022-04-14 23:27:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3528 transitions. [2022-04-14 23:27:35,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:35,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:35,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:35,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:35,451 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-14 23:27:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3527 transitions. [2022-04-14 23:27:35,599 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3527 transitions. Word has length 29 [2022-04-14 23:27:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:35,599 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 3527 transitions. [2022-04-14 23:27:35,600 INFO L479 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-14 23:27:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3527 transitions. [2022-04-14 23:27:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:35,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:35,601 INFO L499 BasicCegarLoop]: 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-14 23:27:35,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 23:27:35,601 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -701181757, now seen corresponding path program 1 times [2022-04-14 23:27:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846624368] [2022-04-14 23:27:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:35,637 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-14 23:27:35,637 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-14 23:27:35,637 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-14 23:27:35,637 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {53602#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53602#true} is VALID [2022-04-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,638 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-14 23:27:35,639 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-14 23:27:35,639 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-14 23:27:35,639 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-14 23:27:35,639 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-14 23:27:35,640 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-14 23:27:35,640 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-14 23:27:35,640 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-14 23:27:35,641 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-14 23:27:35,641 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-14 23:27:35,642 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-14 23:27:35,642 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-14 23:27:35,642 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-14 23:27:35,642 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-14 23:27:35,643 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-14 23:27:35,643 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-14 23:27:35,643 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-14 23:27:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:35,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846624368] [2022-04-14 23:27:35,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846624368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:35,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:35,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440223556] [2022-04-14 23:27:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:35,644 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-14 23:27:35,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:35,644 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-14 23:27:35,660 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-14 23:27:35,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:35,661 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-14 23:27:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:36,324 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-14 23:27:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:36,324 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-14 23:27:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:36,324 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-14 23:27:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:27:36,327 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-14 23:27:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:27:36,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-04-14 23:27:36,416 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-14 23:27:36,880 INFO L225 Difference]: With dead ends: 4107 [2022-04-14 23:27:36,880 INFO L226 Difference]: Without dead ends: 4107 [2022-04-14 23:27:36,880 INFO L912 BasicCegarLoop]: 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-14 23:27:36,880 INFO L913 BasicCegarLoop]: 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-14 23:27:36,881 INFO L914 BasicCegarLoop]: 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-14 23:27:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-14 23:27:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-14 23:27:36,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:36,914 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-14 23:27:36,917 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-14 23:27:36,920 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-14 23:27:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:37,392 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-14 23:27:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-14 23:27:37,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:37,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:37,418 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-14 23:27:37,421 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-14 23:27:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:37,941 INFO L93 Difference]: Finished difference Result 4107 states and 6344 transitions. [2022-04-14 23:27:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6344 transitions. [2022-04-14 23:27:37,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:37,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:37,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:37,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:37,950 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-14 23:27:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4935 transitions. [2022-04-14 23:27:38,328 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4935 transitions. Word has length 29 [2022-04-14 23:27:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:38,328 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4935 transitions. [2022-04-14 23:27:38,328 INFO L479 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-14 23:27:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4935 transitions. [2022-04-14 23:27:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:38,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:38,330 INFO L499 BasicCegarLoop]: 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-14 23:27:38,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 23:27:38,330 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:38,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 806370052, now seen corresponding path program 1 times [2022-04-14 23:27:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:38,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71660485] [2022-04-14 23:27:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:38,383 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-14 23:27:38,383 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-14 23:27:38,383 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-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {69272#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69272#true} is VALID [2022-04-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,384 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-14 23:27:38,385 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-14 23:27:38,385 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-14 23:27:38,385 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-14 23:27:38,385 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-14 23:27:38,385 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-14 23:27:38,386 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-14 23:27:38,386 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-14 23:27:38,386 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-14 23:27:38,386 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-14 23:27:38,387 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-14 23:27:38,387 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-14 23:27:38,387 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-14 23:27:38,387 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-14 23:27:38,387 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-14 23:27:38,388 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-14 23:27:38,388 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-14 23:27:38,388 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-14 23:27:38,388 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-14 23:27:38,388 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-14 23:27:38,389 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-14 23:27:38,389 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-14 23:27:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71660485] [2022-04-14 23:27:38,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71660485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:38,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:38,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830340904] [2022-04-14 23:27:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:38,389 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-14 23:27:38,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:38,390 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-14 23:27:38,404 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-14 23:27:38,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:38,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:38,404 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-14 23:27:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:39,181 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-14 23:27:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:39,182 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-14 23:27:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:39,182 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-14 23:27:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-14 23:27:39,183 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-14 23:27:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-14 23:27:39,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-14 23:27:39,303 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-14 23:27:39,879 INFO L225 Difference]: With dead ends: 4491 [2022-04-14 23:27:39,879 INFO L226 Difference]: Without dead ends: 4491 [2022-04-14 23:27:39,880 INFO L912 BasicCegarLoop]: 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-14 23:27:39,880 INFO L913 BasicCegarLoop]: 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-14 23:27:39,880 INFO L914 BasicCegarLoop]: 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-14 23:27:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-14 23:27:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-14 23:27:39,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:39,926 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-14 23:27:39,930 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-14 23:27:39,933 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-14 23:27:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:40,542 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-14 23:27:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-14 23:27:40,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:40,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:40,552 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-14 23:27:40,555 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-14 23:27:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:41,169 INFO L93 Difference]: Finished difference Result 4491 states and 6600 transitions. [2022-04-14 23:27:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6600 transitions. [2022-04-14 23:27:41,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:41,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:41,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:41,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:41,178 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-14 23:27:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6599 transitions. [2022-04-14 23:27:41,826 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6599 transitions. Word has length 29 [2022-04-14 23:27:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:41,826 INFO L478 AbstractCegarLoop]: Abstraction has 4489 states and 6599 transitions. [2022-04-14 23:27:41,826 INFO L479 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-14 23:27:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6599 transitions. [2022-04-14 23:27:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:41,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:41,829 INFO L499 BasicCegarLoop]: 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-14 23:27:41,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 23:27:41,829 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash -261765188, now seen corresponding path program 1 times [2022-04-14 23:27:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:41,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477461209] [2022-04-14 23:27:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:41,874 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-14 23:27:41,874 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-14 23:27:41,874 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-14 23:27:41,874 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-14 23:27:41,874 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {87246#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87246#true} is VALID [2022-04-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,875 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-14 23:27:41,876 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-14 23:27:41,876 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-14 23:27:41,876 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-14 23:27:41,877 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-14 23:27:41,877 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-14 23:27:41,877 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-14 23:27:41,877 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-14 23:27:41,877 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-14 23:27:41,878 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-14 23:27:41,878 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-14 23:27:41,878 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-14 23:27:41,878 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-14 23:27:41,879 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-14 23:27:41,879 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-14 23:27:41,879 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-14 23:27:41,879 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-14 23:27:41,879 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-14 23:27:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477461209] [2022-04-14 23:27:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477461209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:41,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771754401] [2022-04-14 23:27:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:41,880 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-14 23:27:41,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:41,880 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-14 23:27:41,903 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-14 23:27:41,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:41,904 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-14 23:27:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:42,691 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-14 23:27:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:42,691 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-14 23:27:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:42,693 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-14 23:27:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-14 23:27:42,697 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-14 23:27:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-14 23:27:42,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 140 transitions. [2022-04-14 23:27:42,798 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-14 23:27:43,396 INFO L225 Difference]: With dead ends: 4555 [2022-04-14 23:27:43,396 INFO L226 Difference]: Without dead ends: 4555 [2022-04-14 23:27:43,396 INFO L912 BasicCegarLoop]: 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-14 23:27:43,397 INFO L913 BasicCegarLoop]: 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-14 23:27:43,397 INFO L914 BasicCegarLoop]: 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-14 23:27:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-14 23:27:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-14 23:27:43,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:43,451 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-14 23:27:43,454 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-14 23:27:43,457 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-14 23:27:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:44,071 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-14 23:27:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-14 23:27:44,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:44,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:44,079 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-14 23:27:44,083 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-14 23:27:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:44,679 INFO L93 Difference]: Finished difference Result 4555 states and 6600 transitions. [2022-04-14 23:27:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6600 transitions. [2022-04-14 23:27:44,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:44,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:44,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:44,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:44,688 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-14 23:27:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6599 transitions. [2022-04-14 23:27:45,342 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6599 transitions. Word has length 30 [2022-04-14 23:27:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:45,342 INFO L478 AbstractCegarLoop]: Abstraction has 4553 states and 6599 transitions. [2022-04-14 23:27:45,343 INFO L479 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-14 23:27:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6599 transitions. [2022-04-14 23:27:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:45,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:45,344 INFO L499 BasicCegarLoop]: 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-14 23:27:45,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 23:27:45,344 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash -772299365, now seen corresponding path program 1 times [2022-04-14 23:27:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:45,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122404454] [2022-04-14 23:27:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:45,409 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-14 23:27:45,409 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-14 23:27:45,409 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {105476#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105476#true} is VALID [2022-04-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,410 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,411 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-14 23:27:45,412 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-14 23:27:45,412 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-14 23:27:45,412 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-14 23:27:45,412 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-14 23:27:45,413 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-14 23:27:45,413 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-14 23:27:45,413 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-14 23:27:45,413 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-14 23:27:45,414 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-14 23:27:45,414 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-14 23:27:45,414 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-14 23:27:45,414 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-14 23:27:45,415 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-14 23:27:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122404454] [2022-04-14 23:27:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122404454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:45,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401104717] [2022-04-14 23:27:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:45,415 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-14 23:27:45,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:45,415 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-14 23:27:45,432 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-14 23:27:45,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:45,433 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-14 23:27:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:47,459 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-14 23:27:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:47,460 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-14 23:27:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:47,460 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-14 23:27:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:47,461 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-14 23:27:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:47,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-14 23:27:47,535 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-14 23:27:49,374 INFO L225 Difference]: With dead ends: 7947 [2022-04-14 23:27:49,374 INFO L226 Difference]: Without dead ends: 7947 [2022-04-14 23:27:49,375 INFO L912 BasicCegarLoop]: 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-14 23:27:49,375 INFO L913 BasicCegarLoop]: 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-14 23:27:49,375 INFO L914 BasicCegarLoop]: 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-14 23:27:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-14 23:27:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-14 23:27:49,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:49,467 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-14 23:27:49,473 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-14 23:27:49,479 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-14 23:27:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:51,355 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-14 23:27:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-14 23:27:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:51,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:51,368 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-14 23:27:51,374 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-14 23:27:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:53,417 INFO L93 Difference]: Finished difference Result 7947 states and 11656 transitions. [2022-04-14 23:27:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11656 transitions. [2022-04-14 23:27:53,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:53,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:53,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:53,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:53,430 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-14 23:27:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9351 transitions. [2022-04-14 23:27:54,999 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9351 transitions. Word has length 30 [2022-04-14 23:27:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:55,000 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 9351 transitions. [2022-04-14 23:27:55,000 INFO L479 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-14 23:27:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9351 transitions. [2022-04-14 23:27:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:55,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:55,003 INFO L499 BasicCegarLoop]: 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-14 23:27:55,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 23:27:55,003 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash 735252444, now seen corresponding path program 1 times [2022-04-14 23:27:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:55,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470539588] [2022-04-14 23:27:55,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:55,030 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-14 23:27:55,030 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-14 23:27:55,030 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-14 23:27:55,030 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-14 23:27:55,030 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {135994#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135994#true} is VALID [2022-04-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,031 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-14 23:27:55,032 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-14 23:27:55,032 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-14 23:27:55,032 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-14 23:27:55,032 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-14 23:27:55,033 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-14 23:27:55,033 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-14 23:27:55,033 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-14 23:27:55,033 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-14 23:27:55,034 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-14 23:27:55,034 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-14 23:27:55,034 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-14 23:27:55,034 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-14 23:27:55,034 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-14 23:27:55,035 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-14 23:27:55,035 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-14 23:27:55,035 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-14 23:27:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:55,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470539588] [2022-04-14 23:27:55,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470539588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:55,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:55,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:55,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769038991] [2022-04-14 23:27:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:55,036 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-14 23:27:55,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:55,036 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-14 23:27:55,051 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-14 23:27:55,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:55,052 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-14 23:27:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:57,482 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-14 23:27:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:57,483 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-14 23:27:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:57,483 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-14 23:27:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-14 23:27:57,484 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-14 23:27:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-14 23:27:57,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-14 23:27:57,570 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-14 23:27:59,617 INFO L225 Difference]: With dead ends: 8843 [2022-04-14 23:27:59,617 INFO L226 Difference]: Without dead ends: 8843 [2022-04-14 23:27:59,617 INFO L912 BasicCegarLoop]: 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-14 23:27:59,619 INFO L913 BasicCegarLoop]: 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-14 23:27:59,619 INFO L914 BasicCegarLoop]: 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-14 23:27:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-14 23:27:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-14 23:27:59,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:59,715 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-14 23:27:59,724 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-14 23:27:59,733 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-14 23:28:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:02,037 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-14 23:28:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-14 23:28:02,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:02,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:02,052 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-14 23:28:02,058 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-14 23:28:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:04,504 INFO L93 Difference]: Finished difference Result 8843 states and 12296 transitions. [2022-04-14 23:28:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12296 transitions. [2022-04-14 23:28:04,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:04,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:04,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:04,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:04,521 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-14 23:28:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12295 transitions. [2022-04-14 23:28:06,704 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12295 transitions. Word has length 30 [2022-04-14 23:28:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:06,704 INFO L478 AbstractCegarLoop]: Abstraction has 8841 states and 12295 transitions. [2022-04-14 23:28:06,704 INFO L479 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-14 23:28:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12295 transitions. [2022-04-14 23:28:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:28:06,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:06,707 INFO L499 BasicCegarLoop]: 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-14 23:28:06,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 23:28:06,708 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1828556384, now seen corresponding path program 1 times [2022-04-14 23:28:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:06,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309112776] [2022-04-14 23:28:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:06,779 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-14 23:28:06,779 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-14 23:28:06,779 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {171376#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171376#true} is VALID [2022-04-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,781 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-14 23:28:06,782 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-14 23:28:06,782 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-14 23:28:06,782 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-14 23:28:06,782 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-14 23:28:06,782 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-14 23:28:06,783 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-14 23:28:06,783 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-14 23:28:06,783 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-14 23:28:06,794 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-14 23:28:06,795 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-14 23:28:06,795 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-14 23:28:06,795 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-14 23:28:06,795 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-14 23:28:06,796 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-14 23:28:06,796 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-14 23:28:06,796 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-14 23:28:06,796 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-14 23:28:06,796 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-14 23:28:06,796 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-14 23:28:06,797 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-14 23:28:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309112776] [2022-04-14 23:28:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309112776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:06,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:06,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563573038] [2022-04-14 23:28:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:06,797 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-14 23:28:06,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:06,797 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-14 23:28:06,814 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-14 23:28:06,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:06,815 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-14 23:28:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:09,426 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-14 23:28:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:09,426 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-14 23:28:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:09,426 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-14 23:28:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:28:09,428 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-14 23:28:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:28:09,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-14 23:28:09,515 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-14 23:28:11,956 INFO L225 Difference]: With dead ends: 8971 [2022-04-14 23:28:11,956 INFO L226 Difference]: Without dead ends: 8971 [2022-04-14 23:28:11,956 INFO L912 BasicCegarLoop]: 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-14 23:28:11,968 INFO L913 BasicCegarLoop]: 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-14 23:28:11,969 INFO L914 BasicCegarLoop]: 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-14 23:28:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-14 23:28:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-14 23:28:12,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:12,056 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-14 23:28:12,063 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-14 23:28:12,069 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-14 23:28:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:14,374 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-14 23:28:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-14 23:28:14,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:14,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:14,386 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-14 23:28:14,391 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-14 23:28:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:16,839 INFO L93 Difference]: Finished difference Result 8971 states and 12296 transitions. [2022-04-14 23:28:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12296 transitions. [2022-04-14 23:28:16,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:16,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:16,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:16,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:16,851 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-14 23:28:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12295 transitions. [2022-04-14 23:28:19,403 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12295 transitions. Word has length 31 [2022-04-14 23:28:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:19,403 INFO L478 AbstractCegarLoop]: Abstraction has 8969 states and 12295 transitions. [2022-04-14 23:28:19,404 INFO L479 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-14 23:28:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12295 transitions. [2022-04-14 23:28:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:28:19,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:19,407 INFO L499 BasicCegarLoop]: 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-14 23:28:19,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 23:28:19,407 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1318022207, now seen corresponding path program 1 times [2022-04-14 23:28:19,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:19,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797728035] [2022-04-14 23:28:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:19,436 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-14 23:28:19,436 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-14 23:28:19,437 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-14 23:28:19,437 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-14 23:28:19,437 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-14 23:28:19,437 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-14 23:28:19,437 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-14 23:28:19,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {207270#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207270#true} is VALID [2022-04-14 23:28:19,437 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-14 23:28:19,437 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,438 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-14 23:28:19,439 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-14 23:28:19,439 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-14 23:28:19,439 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-14 23:28:19,439 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-14 23:28:19,439 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-14 23:28:19,440 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-14 23:28:19,440 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-14 23:28:19,440 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-14 23:28:19,440 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-14 23:28:19,441 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-14 23:28:19,441 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-14 23:28:19,441 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-14 23:28:19,441 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-14 23:28:19,441 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-14 23:28:19,442 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-14 23:28:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797728035] [2022-04-14 23:28:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797728035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:19,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:19,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054020046] [2022-04-14 23:28:19,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:19,442 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-14 23:28:19,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:19,443 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-14 23:28:19,458 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-14 23:28:19,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:19,459 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-14 23:28:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:26,332 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-14 23:28:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:26,332 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-14 23:28:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:26,332 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-14 23:28:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:28:26,333 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-14 23:28:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:28:26,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-14 23:28:26,417 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-14 23:28:32,873 INFO L225 Difference]: With dead ends: 15371 [2022-04-14 23:28:32,873 INFO L226 Difference]: Without dead ends: 15371 [2022-04-14 23:28:32,873 INFO L912 BasicCegarLoop]: 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-14 23:28:32,874 INFO L913 BasicCegarLoop]: 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-14 23:28:32,874 INFO L914 BasicCegarLoop]: 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-14 23:28:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-14 23:28:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-14 23:28:32,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:32,985 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-14 23:28:32,997 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-14 23:28:33,011 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-14 23:28:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:40,354 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-14 23:28:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-14 23:28:40,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:40,501 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-14 23:28:40,511 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-14 23:28:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:48,029 INFO L93 Difference]: Finished difference Result 15371 states and 21256 transitions. [2022-04-14 23:28:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21256 transitions. [2022-04-14 23:28:48,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:48,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:48,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:48,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:48,050 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-14 23:28:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 17671 transitions. [2022-04-14 23:28:53,450 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 17671 transitions. Word has length 31 [2022-04-14 23:28:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:53,450 INFO L478 AbstractCegarLoop]: Abstraction has 13321 states and 17671 transitions. [2022-04-14 23:28:53,450 INFO L479 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-14 23:28:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 17671 transitions. [2022-04-14 23:28:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:28:53,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:53,457 INFO L499 BasicCegarLoop]: 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-14 23:28:53,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 23:28:53,457 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1469393280, now seen corresponding path program 1 times [2022-04-14 23:28:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:53,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181708615] [2022-04-14 23:28:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:53,481 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-14 23:28:53,481 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-14 23:28:53,481 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-14 23:28:53,481 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {266716#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266716#true} is VALID [2022-04-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,482 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-14 23:28:53,483 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-14 23:28:53,483 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-14 23:28:53,483 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-14 23:28:53,483 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-14 23:28:53,484 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-14 23:28:53,484 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-14 23:28:53,484 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-14 23:28:53,484 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-14 23:28:53,485 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-14 23:28:53,485 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-14 23:28:53,485 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-14 23:28:53,485 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-14 23:28:53,485 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-14 23:28:53,485 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-14 23:28:53,486 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-14 23:28:53,486 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-14 23:28:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:53,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181708615] [2022-04-14 23:28:53,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181708615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:53,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:53,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655812404] [2022-04-14 23:28:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:53,486 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-14 23:28:53,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:53,487 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-14 23:28:53,502 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-14 23:28:53,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:53,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:53,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:53,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:53,502 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-14 23:29:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:02,752 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-14 23:29:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:02,752 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-14 23:29:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:02,752 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-14 23:29:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-14 23:29:02,753 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-14 23:29:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-14 23:29:02,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 137 transitions. [2022-04-14 23:29:02,846 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-14 23:29:11,451 INFO L225 Difference]: With dead ends: 17419 [2022-04-14 23:29:11,451 INFO L226 Difference]: Without dead ends: 17419 [2022-04-14 23:29:11,451 INFO L912 BasicCegarLoop]: 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-14 23:29:11,452 INFO L913 BasicCegarLoop]: 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-14 23:29:11,453 INFO L914 BasicCegarLoop]: 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-14 23:29:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-14 23:29:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-14 23:29:11,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:11,587 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-14 23:29:11,605 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-14 23:29:11,623 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-14 23:29:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:20,088 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-14 23:29:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-14 23:29:20,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:20,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:20,114 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-14 23:29:20,126 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-14 23:29:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:28,879 INFO L93 Difference]: Finished difference Result 17419 states and 22792 transitions. [2022-04-14 23:29:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 22792 transitions. [2022-04-14 23:29:28,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:28,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:28,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:28,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:28,903 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-14 23:29:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 22791 transitions. [2022-04-14 23:29:39,076 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 22791 transitions. Word has length 31 [2022-04-14 23:29:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:39,078 INFO L478 AbstractCegarLoop]: Abstraction has 17417 states and 22791 transitions. [2022-04-14 23:29:39,078 INFO L479 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-14 23:29:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 22791 transitions. [2022-04-14 23:29:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:29:39,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:39,085 INFO L499 BasicCegarLoop]: 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-14 23:29:39,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 23:29:39,085 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2090951496, now seen corresponding path program 1 times [2022-04-14 23:29:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491580887] [2022-04-14 23:29:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:39,138 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-14 23:29:39,138 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-14 23:29:39,138 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-14 23:29:39,138 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-14 23:29:39,138 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-14 23:29:39,138 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-14 23:29:39,139 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-14 23:29:39,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {336402#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336402#true} is VALID [2022-04-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,139 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-14 23:29:39,140 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-14 23:29:39,140 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-14 23:29:39,140 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-14 23:29:39,140 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-14 23:29:39,140 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-14 23:29:39,141 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-14 23:29:39,147 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-14 23:29:39,147 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,148 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-14 23:29:39,149 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-14 23:29:39,149 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-14 23:29:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:39,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491580887] [2022-04-14 23:29:39,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491580887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:39,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:39,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940804158] [2022-04-14 23:29:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:39,149 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-14 23:29:39,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:39,150 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-14 23:29:39,165 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-14 23:29:39,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:39,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:39,166 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-14 23:29:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:48,221 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-14 23:29:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:48,221 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-14 23:29:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:48,221 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-14 23:29:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:29:48,222 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-14 23:29:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:29:48,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-14 23:29:48,301 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-14 23:29:57,052 INFO L225 Difference]: With dead ends: 17675 [2022-04-14 23:29:57,053 INFO L226 Difference]: Without dead ends: 17675 [2022-04-14 23:29:57,053 INFO L912 BasicCegarLoop]: 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-14 23:29:57,054 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:57,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:29:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-14 23:29:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-14 23:29:57,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:57,215 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-14 23:29:57,234 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-14 23:29:57,253 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-14 23:30:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:05,897 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-14 23:30:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-14 23:30:05,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:05,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:05,922 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-14 23:30:05,937 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-14 23:30:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:15,093 INFO L93 Difference]: Finished difference Result 17675 states and 22792 transitions. [2022-04-14 23:30:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 22792 transitions. [2022-04-14 23:30:15,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:15,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:15,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:30:15,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:30:15,120 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-14 23:30:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 22791 transitions. [2022-04-14 23:30:25,504 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 22791 transitions. Word has length 32 [2022-04-14 23:30:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:30:25,504 INFO L478 AbstractCegarLoop]: Abstraction has 17673 states and 22791 transitions. [2022-04-14 23:30:25,504 INFO L479 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-14 23:30:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 22791 transitions. [2022-04-14 23:30:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:30:25,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:30:25,511 INFO L499 BasicCegarLoop]: 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-14 23:30:25,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 23:30:25,511 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:30:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:30:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1693481623, now seen corresponding path program 1 times [2022-04-14 23:30:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:30:25,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448341172] [2022-04-14 23:30:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:30:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:30:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:30:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:25,539 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-14 23:30:25,539 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {407112#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407112#true} is VALID [2022-04-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,540 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,541 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-14 23:30:25,542 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-14 23:30:25,542 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-14 23:30:25,542 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-14 23:30:25,542 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-14 23:30:25,543 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-14 23:30:25,543 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-14 23:30:25,543 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-14 23:30:25,543 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-14 23:30:25,543 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-14 23:30:25,544 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-14 23:30:25,544 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-14 23:30:25,544 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-14 23:30:25,544 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-14 23:30:25,544 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-14 23:30:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:30:25,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448341172] [2022-04-14 23:30:25,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448341172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:30:25,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:30:25,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:30:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466642652] [2022-04-14 23:30:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:30:25,545 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-14 23:30:25,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:30:25,545 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-14 23:30:25,561 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-14 23:30:25,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:30:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:30:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:30:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:30:25,562 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-14 23:31:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:31:12,959 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-14 23:31:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:31:12,959 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-14 23:31:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:31:12,960 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-14 23:31:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:31:12,960 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-14 23:31:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:31:12,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-14 23:31:13,032 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-14 23:31:41,357 INFO L225 Difference]: With dead ends: 29707 [2022-04-14 23:31:41,357 INFO L226 Difference]: Without dead ends: 29707 [2022-04-14 23:31:41,358 INFO L912 BasicCegarLoop]: 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-14 23:31:41,358 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:31:41,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:31:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29707 states. [2022-04-14 23:31:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29707 to 26633. [2022-04-14 23:31:41,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:31:41,606 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-14 23:31:41,636 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-14 23:31:41,665 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-14 23:32:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:32:19,957 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-14 23:32:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-14 23:32:19,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:32:19,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:32:19,997 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-14 23:32:20,019 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-14 23:32:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:32:52,390 INFO L93 Difference]: Finished difference Result 29707 states and 38408 transitions. [2022-04-14 23:32:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 38408 transitions. [2022-04-14 23:32:52,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:32:52,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:32:52,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:32:52,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:32:52,429 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-14 23:33:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26633 states to 26633 states and 33287 transitions. [2022-04-14 23:33:20,891 INFO L78 Accepts]: Start accepts. Automaton has 26633 states and 33287 transitions. Word has length 32 [2022-04-14 23:33:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:33:20,891 INFO L478 AbstractCegarLoop]: Abstraction has 26633 states and 33287 transitions. [2022-04-14 23:33:20,891 INFO L479 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-14 23:33:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 26633 states and 33287 transitions. [2022-04-14 23:33:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:33:20,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:33:20,903 INFO L499 BasicCegarLoop]: 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-14 23:33:20,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-14 23:33:20,904 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:33:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:33:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1093933864, now seen corresponding path program 1 times [2022-04-14 23:33:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:33:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264481967] [2022-04-14 23:33:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:33:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:33:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:33:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:33:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:33:20,961 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-14 23:33:20,961 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {522878#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {522878#true} is VALID [2022-04-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,962 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,963 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-14 23:33:20,964 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-14 23:33:20,964 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-14 23:33:20,964 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-14 23:33:20,965 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-14 23:33:20,965 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-14 23:33:20,965 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-14 23:33:20,965 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-14 23:33:20,966 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-14 23:33:20,966 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-14 23:33:20,966 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-14 23:33:20,966 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-14 23:33:20,966 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-14 23:33:20,966 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-14 23:33:20,967 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-14 23:33:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:33:20,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264481967] [2022-04-14 23:33:20,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264481967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:33:20,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:33:20,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:33:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179511462] [2022-04-14 23:33:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:33:20,967 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-14 23:33:20,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:33:20,967 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-14 23:33:20,982 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-14 23:33:20,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:33:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:33:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:33:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:33:20,983 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-14 23:34:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:34:30,569 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-14 23:34:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:34:30,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-14 23:34:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:34:30,569 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-14 23:34:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-14 23:34:30,570 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-14 23:34:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-14 23:34:30,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-14 23:34:30,685 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-14 23:35:25,483 INFO L225 Difference]: With dead ends: 34315 [2022-04-14 23:35:25,484 INFO L226 Difference]: Without dead ends: 34315 [2022-04-14 23:35:25,484 INFO L912 BasicCegarLoop]: 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-14 23:35:25,484 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:35:25,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:35:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-14 23:35:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-14 23:35:25,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:35:25,786 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-14 23:35:25,818 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-14 23:35:25,907 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-14 23:36:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:36:05,728 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-14 23:36:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-14 23:36:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:36:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:36:05,777 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-14 23:36:05,801 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-14 23:36:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:36:59,208 INFO L93 Difference]: Finished difference Result 34315 states and 41992 transitions. [2022-04-14 23:36:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34315 states and 41992 transitions. [2022-04-14 23:36:59,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:36:59,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:36:59,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:36:59,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:36:59,257 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-14 23:37:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34313 states to 34313 states and 41991 transitions. [2022-04-14 23:37:34,491 INFO L78 Accepts]: Start accepts. Automaton has 34313 states and 41991 transitions. Word has length 32 [2022-04-14 23:37:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:37:34,491 INFO L478 AbstractCegarLoop]: Abstraction has 34313 states and 41991 transitions. [2022-04-14 23:37:34,491 INFO L479 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-14 23:37:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34313 states and 41991 transitions. [2022-04-14 23:37:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 23:37:34,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:37:34,508 INFO L499 BasicCegarLoop]: 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-14 23:37:34,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-14 23:37:34,508 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:37:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:37:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 958355932, now seen corresponding path program 1 times [2022-04-14 23:37:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:37:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327778072] [2022-04-14 23:37:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:37:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:37:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:37:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:37:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:37:34,593 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-14 23:37:34,593 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-14 23:37:34,593 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {660148#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660148#true} is VALID [2022-04-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,594 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-14 23:37:34,595 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-14 23:37:34,595 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-14 23:37:34,595 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-14 23:37:34,595 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-14 23:37:34,595 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-14 23:37:34,595 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-14 23:37:34,596 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-14 23:37:34,596 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-14 23:37:34,596 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-14 23:37:34,596 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-14 23:37:34,597 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-14 23:37:34,597 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-14 23:37:34,597 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-14 23:37:34,598 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-14 23:37:34,598 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-14 23:37:34,598 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-14 23:37:34,598 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-14 23:37:34,598 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-14 23:37:34,599 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-14 23:37:34,599 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-14 23:37:34,599 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-14 23:37:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:37:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327778072] [2022-04-14 23:37:34,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327778072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:37:34,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:37:34,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:37:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076621727] [2022-04-14 23:37:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:37:34,599 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-14 23:37:34,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:37:34,600 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-14 23:37:34,620 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-14 23:37:34,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:37:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:37:34,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:37:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:37:34,624 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-14 23:38:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:38:09,730 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-14 23:38:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:38:09,730 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-14 23:38:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:38:09,730 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-14 23:38:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:38:09,731 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-14 23:38:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:38:09,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-14 23:38:09,804 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-14 23:38:45,615 INFO L225 Difference]: With dead ends: 34827 [2022-04-14 23:38:45,615 INFO L226 Difference]: Without dead ends: 34827 [2022-04-14 23:38:45,619 INFO L912 BasicCegarLoop]: 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-14 23:38:45,620 INFO L913 BasicCegarLoop]: 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-14 23:38:45,620 INFO L914 BasicCegarLoop]: 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-14 23:38:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34827 states. [2022-04-14 23:38:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34827 to 34825. [2022-04-14 23:38:45,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:38:45,938 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-14 23:38:45,973 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-14 23:38:46,008 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-14 23:39:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:39:20,011 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-14 23:39:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34827 states and 41992 transitions. [2022-04-14 23:39:20,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:39:20,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:39:20,057 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-14 23:39:20,083 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-14 23:39:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:39:57,532 INFO L93 Difference]: Finished difference Result 34827 states and 41992 transitions. [2022-04-14 23:39:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34827 states and 41992 transitions. [2022-04-14 23:39:57,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:39:57,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:39:57,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:39:57,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:39:57,581 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-14 23:40:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 41991 transitions. [2022-04-14 23:40:50,602 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 41991 transitions. Word has length 33 [2022-04-14 23:40:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:40:50,603 INFO L478 AbstractCegarLoop]: Abstraction has 34825 states and 41991 transitions. [2022-04-14 23:40:50,603 INFO L479 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-14 23:40:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 41991 transitions. [2022-04-14 23:40:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 23:40:50,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:40:50,636 INFO L499 BasicCegarLoop]: 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-14 23:40:50,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-14 23:40:50,637 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:40:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:40:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash 447821755, now seen corresponding path program 1 times [2022-04-14 23:40:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:40:50,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521093358] [2022-04-14 23:40:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:40:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:40:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:40:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:40:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:40:50,701 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-14 23:40:50,701 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-14 23:40:50,701 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-14 23:40:50,701 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {799466#true} [238] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799466#true} is VALID [2022-04-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,702 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-14 23:40:50,703 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-14 23:40:50,703 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-14 23:40:50,703 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-14 23:40:50,703 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-14 23:40:50,703 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-14 23:40:50,704 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-14 23:40:50,704 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-14 23:40:50,704 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-14 23:40:50,704 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-14 23:40:50,723 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-14 23:40:50,724 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-14 23:40:50,725 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-14 23:40:50,725 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-14 23:40:50,726 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-14 23:40:50,726 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-14 23:40:50,726 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-14 23:40:50,726 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-14 23:40:50,726 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-14 23:40:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:40:50,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521093358] [2022-04-14 23:40:50,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521093358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:40:50,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:40:50,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:40:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934898273] [2022-04-14 23:40:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:40:50,729 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-14 23:40:50,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:40:50,729 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-14 23:40:50,745 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-14 23:40:50,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:40:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:40:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:40:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:40:50,746 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)