/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:27:26,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:27:26,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:27:26,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:27:26,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:27:26,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:27:26,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:27:26,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:27:26,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:27:26,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:27:26,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:27:26,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:27:26,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:27:26,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:27:26,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:27:26,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:27:26,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:27:26,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:27:26,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:27:26,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:27:26,418 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:27:26,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:27:26,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:27:26,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:27:26,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:27:26,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:27:26,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:27:26,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:27:26,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:27:26,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:27:26,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:27:26,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:27:26,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:27:26,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:27:26,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:27:26,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:27:26,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:27:26,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:27:26,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:27:26,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:27:26,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:27:26,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:27:26,445 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:26,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:27:26,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:27:26,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:27:26,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:27:26,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:27:26,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:27:26,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:27:26,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:27:26,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:27:26,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:27:26,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:27:26,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:27:26,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:27:26,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:26,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:27:26,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:27:26,457 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:27:26,458 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:26,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:27:26,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:27:26,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:27:26,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:27:26,620 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:27:26,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2022-04-14 23:27:26,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7f260b/d0fa792cfb76493db392a57dfe7268f9/FLAG136625341 [2022-04-14 23:27:27,026 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:27:27,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2022-04-14 23:27:27,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7f260b/d0fa792cfb76493db392a57dfe7268f9/FLAG136625341 [2022-04-14 23:27:27,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad7f260b/d0fa792cfb76493db392a57dfe7268f9 [2022-04-14 23:27:27,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:27:27,043 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:27:27,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:27,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:27:27,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:27:27,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:27" (1/1) ... [2022-04-14 23:27:27,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599df675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:27, skipping insertion in model container [2022-04-14 23:27:27,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:27" (1/1) ... [2022-04-14 23:27:27,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:27:27,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:27:27,253 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_13.c[4936,4949] [2022-04-14 23:27:27,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:27,266 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:27:27,295 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_13.c[4936,4949] [2022-04-14 23:27:27,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:27,311 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:27:27,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:27 WrapperNode [2022-04-14 23:27:27,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:27,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:27:27,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:27:27,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:27:27,321 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:27" (1/1) ... [2022-04-14 23:27:27,321 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:27" (1/1) ... [2022-04-14 23:27:27,325 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:27" (1/1) ... [2022-04-14 23:27:27,326 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:27" (1/1) ... [2022-04-14 23:27:27,338 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:27" (1/1) ... [2022-04-14 23:27:27,344 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:27" (1/1) ... [2022-04-14 23:27:27,347 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:27" (1/1) ... [2022-04-14 23:27:27,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:27:27,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:27:27,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:27:27,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:27:27,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:27" (1/1) ... [2022-04-14 23:27:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:27,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:27:27,388 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:27,405 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:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:27:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:27:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:27:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:27:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:27:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:27:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:27:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:27:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:27:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:27:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:27:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:27:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:27:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:27:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:27:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:27:27,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:27:27,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:27:27,685 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:27:27,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:27:27,690 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:27:27,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:27 BoogieIcfgContainer [2022-04-14 23:27:27,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:27:27,692 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:27:27,692 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:27:27,703 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:27:27,706 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:27" (1/1) ... [2022-04-14 23:27:27,707 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:27:27,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:27 BasicIcfg [2022-04-14 23:27:27,744 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:27:27,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:27:27,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:27:27,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:27:27,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:27:27" (1/4) ... [2022-04-14 23:27:27,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adf653c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:27, skipping insertion in model container [2022-04-14 23:27:27,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:27" (2/4) ... [2022-04-14 23:27:27,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adf653c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:27, skipping insertion in model container [2022-04-14 23:27:27,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:27" (3/4) ... [2022-04-14 23:27:27,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adf653c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:27:27, skipping insertion in model container [2022-04-14 23:27:27,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:27" (4/4) ... [2022-04-14 23:27:27,748 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.cJordan [2022-04-14 23:27:27,751 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:27:27,752 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:27:27,777 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:27:27,781 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:27,781 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:27:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:27,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:27,797 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,797 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1381361359, now seen corresponding path program 1 times [2022-04-14 23:27:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:27,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394383220] [2022-04-14 23:27:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:27,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {57#true} is VALID [2022-04-14 23:27:27,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-14 23:27:27,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-14 23:27:27,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:27,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {57#true} is VALID [2022-04-14 23:27:27,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-14 23:27:27,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-14 23:27:27,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-14 23:27:27,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {57#true} is VALID [2022-04-14 23:27:27,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {57#true} is VALID [2022-04-14 23:27:27,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {57#true} is VALID [2022-04-14 23:27:27,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} [267] L83-->L83-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#(= main_~lk1~0 1)} [269] L83-2-->L87-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(= main_~lk1~0 1)} [272] L87-1-->L91-1: Formula: (= 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[] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(= main_~lk1~0 1)} [273] L91-1-->L95-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#(= main_~lk1~0 1)} [275] L95-1-->L99-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#(= main_~lk1~0 1)} [277] L99-1-->L103-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#(= main_~lk1~0 1)} [279] L103-1-->L107-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {62#(= main_~lk1~0 1)} [281] L107-1-->L111-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {62#(= main_~lk1~0 1)} [283] L111-1-->L115-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] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(= main_~lk1~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {62#(= main_~lk1~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {62#(= main_~lk1~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#(= main_~lk1~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#(= main_~lk1~0 1)} [293] L131-1-->L138: 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[] {62#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:27,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {62#(= main_~lk1~0 1)} [295] L138-->L198-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[] {58#false} is VALID [2022-04-14 23:27:27,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {58#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#false} is VALID [2022-04-14 23:27:27,997 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,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:27,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394383220] [2022-04-14 23:27:27,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394383220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:27,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605522166] [2022-04-14 23:27:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:28,003 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,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:28,006 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:28,029 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:28,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:28,049 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 49 states have internal predecessors, (91), 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.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,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,363 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2022-04-14 23:27:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:28,364 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,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:28,365 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,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-14 23:27:28,374 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,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-14 23:27:28,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-14 23:27:28,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:28,534 INFO L225 Difference]: With dead ends: 99 [2022-04-14 23:27:28,534 INFO L226 Difference]: Without dead ends: 91 [2022-04-14 23:27:28,535 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,537 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:28,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-14 23:27:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2022-04-14 23:27:28,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:28,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call 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,561 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call 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,561 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call 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,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,566 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-14 23:27:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-14 23:27:28,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 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 91 states. [2022-04-14 23:27:28,567 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 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 91 states. [2022-04-14 23:27:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,572 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2022-04-14 23:27:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 165 transitions. [2022-04-14 23:27:28,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:28,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call 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,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2022-04-14 23:27:28,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2022-04-14 23:27:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:28,576 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2022-04-14 23:27:28,577 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,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2022-04-14 23:27:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:28,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:28,577 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:28,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:27:28,578 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1891895536, now seen corresponding path program 1 times [2022-04-14 23:27:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:28,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550897906] [2022-04-14 23:27:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:28,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {413#true} is VALID [2022-04-14 23:27:28,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-14 23:27:28,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-14 23:27:28,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:28,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {413#true} is VALID [2022-04-14 23:27:28,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-14 23:27:28,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-14 23:27:28,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-14 23:27:28,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {413#true} is VALID [2022-04-14 23:27:28,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {413#true} is VALID [2022-04-14 23:27:28,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {413#true} is VALID [2022-04-14 23:27:28,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#true} [268] L83-->L83-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[] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= main_~p1~0 0)} [269] L83-2-->L87-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(= main_~p1~0 0)} [272] L87-1-->L91-1: Formula: (= 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[] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#(= main_~p1~0 0)} [273] L91-1-->L95-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#(= main_~p1~0 0)} [275] L95-1-->L99-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#(= main_~p1~0 0)} [277] L99-1-->L103-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(= main_~p1~0 0)} [279] L103-1-->L107-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#(= main_~p1~0 0)} [281] L107-1-->L111-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#(= main_~p1~0 0)} [283] L111-1-->L115-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] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(= main_~p1~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(= main_~p1~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#(= main_~p1~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {418#(= main_~p1~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {418#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:28,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {418#(= main_~p1~0 0)} [293] L131-1-->L138: 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[] {414#false} is VALID [2022-04-14 23:27:28,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {414#false} [295] L138-->L198-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[] {414#false} is VALID [2022-04-14 23:27:28,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {414#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-14 23:27:28,666 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,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:28,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550897906] [2022-04-14 23:27:28,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550897906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:28,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:28,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724179531] [2022-04-14 23:27:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:28,669 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,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:28,669 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:28,683 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:28,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:28,684 INFO L87 Difference]: Start difference. First operand 63 states and 114 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,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,911 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-14 23:27:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:28,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:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:28,912 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,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-14 23:27:28,915 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,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-14 23:27:28,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-14 23:27:29,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:29,052 INFO L225 Difference]: With dead ends: 91 [2022-04-14 23:27:29,052 INFO L226 Difference]: Without dead ends: 91 [2022-04-14 23:27:29,052 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,053 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:29,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-14 23:27:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-04-14 23:27:29,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call 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,058 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call 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,059 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call 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,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,061 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-14 23:27:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-14 23:27:29,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 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 91 states. [2022-04-14 23:27:29,076 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 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 91 states. [2022-04-14 23:27:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,079 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2022-04-14 23:27:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2022-04-14 23:27:29,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call 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,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2022-04-14 23:27:29,082 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2022-04-14 23:27:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,083 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2022-04-14 23:27:29,083 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:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2022-04-14 23:27:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:29,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,084 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:29,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:27:29,084 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 127502905, now seen corresponding path program 1 times [2022-04-14 23:27:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077537585] [2022-04-14 23:27:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {787#true} is VALID [2022-04-14 23:27:29,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-14 23:27:29,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {787#true} {787#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-14 23:27:29,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:29,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {787#true} is VALID [2022-04-14 23:27:29,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-14 23:27:29,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-14 23:27:29,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {787#true} is VALID [2022-04-14 23:27:29,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {787#true} is VALID [2022-04-14 23:27:29,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {787#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {787#true} is VALID [2022-04-14 23:27:29,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {787#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {787#true} is VALID [2022-04-14 23:27:29,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {787#true} [267] L83-->L83-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {792#(not (= main_~p1~0 0))} [269] L83-2-->L87-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {792#(not (= main_~p1~0 0))} [272] L87-1-->L91-1: Formula: (= 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[] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#(not (= main_~p1~0 0))} [273] L91-1-->L95-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {792#(not (= main_~p1~0 0))} [275] L95-1-->L99-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {792#(not (= main_~p1~0 0))} [277] L99-1-->L103-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(not (= main_~p1~0 0))} [279] L103-1-->L107-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {792#(not (= main_~p1~0 0))} [281] L107-1-->L111-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {792#(not (= main_~p1~0 0))} [283] L111-1-->L115-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] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {792#(not (= main_~p1~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {792#(not (= main_~p1~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {792#(not (= main_~p1~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {792#(not (= main_~p1~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {792#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:29,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {792#(not (= main_~p1~0 0))} [294] L131-1-->L137-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[] {788#false} is VALID [2022-04-14 23:27:29,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {788#false} [297] L137-1-->L143: 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[] {788#false} is VALID [2022-04-14 23:27:29,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {788#false} [301] L143-->L198-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[] {788#false} is VALID [2022-04-14 23:27:29,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {788#false} is VALID [2022-04-14 23:27:29,167 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,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077537585] [2022-04-14 23:27:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077537585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961463425] [2022-04-14 23:27:29,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,169 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,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,170 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,184 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,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,185 INFO L87 Difference]: Start difference. First operand 89 states and 162 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,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,365 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-14 23:27:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:29,366 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,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:29,366 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,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2022-04-14 23:27:29,368 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,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2022-04-14 23:27:29,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 164 transitions. [2022-04-14 23:27:29,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:29,488 INFO L225 Difference]: With dead ends: 94 [2022-04-14 23:27:29,488 INFO L226 Difference]: Without dead ends: 94 [2022-04-14 23:27:29,489 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,489 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:29,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-14 23:27:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-04-14 23:27:29,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call 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,494 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call 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,494 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call 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,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,497 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-14 23:27:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-14 23:27:29,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 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 94 states. [2022-04-14 23:27:29,498 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 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 94 states. [2022-04-14 23:27:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,500 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2022-04-14 23:27:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 165 transitions. [2022-04-14 23:27:29,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call 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,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2022-04-14 23:27:29,503 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2022-04-14 23:27:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,504 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2022-04-14 23:27:29,504 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,504 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2022-04-14 23:27:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:29,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,504 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:29,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:27:29,505 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1480812602, now seen corresponding path program 1 times [2022-04-14 23:27:29,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867195124] [2022-04-14 23:27:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {1173#true} is VALID [2022-04-14 23:27:29,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-14 23:27:29,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-14 23:27:29,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:29,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {1173#true} is VALID [2022-04-14 23:27:29,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-14 23:27:29,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-14 23:27:29,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-14 23:27:29,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1173#true} is VALID [2022-04-14 23:27:29,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {1173#true} is VALID [2022-04-14 23:27:29,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {1173#true} is VALID [2022-04-14 23:27:29,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#true} [268] L83-->L83-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[] {1173#true} is VALID [2022-04-14 23:27:29,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} [269] L83-2-->L87-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= main_~lk2~0 1)} [272] L87-1-->L91-1: Formula: (= 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[] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= main_~lk2~0 1)} [273] L91-1-->L95-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= main_~lk2~0 1)} [275] L95-1-->L99-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= main_~lk2~0 1)} [277] L99-1-->L103-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= main_~lk2~0 1)} [279] L103-1-->L107-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= main_~lk2~0 1)} [281] L107-1-->L111-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= main_~lk2~0 1)} [283] L111-1-->L115-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] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= main_~lk2~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= main_~lk2~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= main_~lk2~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= main_~lk2~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= main_~lk2~0 1)} [294] L131-1-->L137-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[] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= main_~lk2~0 1)} [297] L137-1-->L143: 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[] {1178#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:29,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= main_~lk2~0 1)} [301] L143-->L198-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[] {1174#false} is VALID [2022-04-14 23:27:29,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-14 23:27:29,556 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,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867195124] [2022-04-14 23:27:29,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867195124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863026081] [2022-04-14 23:27:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,558 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,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,558 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,571 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,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,572 INFO L87 Difference]: Start difference. First operand 92 states and 164 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,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,776 INFO L93 Difference]: Finished difference Result 171 states and 310 transitions. [2022-04-14 23:27:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:29,776 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,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:29,778 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,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:29,780 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,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:29,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-14 23:27:29,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:29,888 INFO L225 Difference]: With dead ends: 171 [2022-04-14 23:27:29,888 INFO L226 Difference]: Without dead ends: 171 [2022-04-14 23:27:29,888 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,897 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 212 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:29,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-14 23:27:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2022-04-14 23:27:29,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:29,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call 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,906 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call 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,907 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call 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,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,915 INFO L93 Difference]: Finished difference Result 171 states and 310 transitions. [2022-04-14 23:27:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 310 transitions. [2022-04-14 23:27:29,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 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 171 states. [2022-04-14 23:27:29,916 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 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 171 states. [2022-04-14 23:27:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:29,921 INFO L93 Difference]: Finished difference Result 171 states and 310 transitions. [2022-04-14 23:27:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 310 transitions. [2022-04-14 23:27:29,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.829059829059829) internal successors, (214), 117 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call 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,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 217 transitions. [2022-04-14 23:27:29,924 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 217 transitions. Word has length 25 [2022-04-14 23:27:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,925 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 217 transitions. [2022-04-14 23:27:29,925 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,925 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 217 transitions. [2022-04-14 23:27:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:29,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,926 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:29,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:27:29,926 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 970278425, now seen corresponding path program 1 times [2022-04-14 23:27:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324946911] [2022-04-14 23:27:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {1825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {1819#true} is VALID [2022-04-14 23:27:29,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1819#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1819#true} is VALID [2022-04-14 23:27:29,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1819#true} {1819#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1819#true} is VALID [2022-04-14 23:27:29,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {1819#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:29,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {1819#true} is VALID [2022-04-14 23:27:29,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1819#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1819#true} is VALID [2022-04-14 23:27:29,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1819#true} {1819#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1819#true} is VALID [2022-04-14 23:27:29,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1819#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1819#true} is VALID [2022-04-14 23:27:29,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1819#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1819#true} is VALID [2022-04-14 23:27:29,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {1819#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {1819#true} is VALID [2022-04-14 23:27:29,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1819#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {1819#true} is VALID [2022-04-14 23:27:29,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {1819#true} [268] L83-->L83-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[] {1819#true} is VALID [2022-04-14 23:27:29,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1819#true} [270] L83-2-->L87-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[] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1824#(= main_~p2~0 0)} [272] L87-1-->L91-1: Formula: (= 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[] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {1824#(= main_~p2~0 0)} [273] L91-1-->L95-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {1824#(= main_~p2~0 0)} [275] L95-1-->L99-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {1824#(= main_~p2~0 0)} [277] L99-1-->L103-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {1824#(= main_~p2~0 0)} [279] L103-1-->L107-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1824#(= main_~p2~0 0)} [281] L107-1-->L111-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1824#(= main_~p2~0 0)} [283] L111-1-->L115-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] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1824#(= main_~p2~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {1824#(= main_~p2~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {1824#(= main_~p2~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {1824#(= main_~p2~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {1824#(= main_~p2~0 0)} [294] L131-1-->L137-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[] {1824#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:29,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {1824#(= main_~p2~0 0)} [297] L137-1-->L143: 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[] {1820#false} is VALID [2022-04-14 23:27:29,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {1820#false} [301] L143-->L198-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[] {1820#false} is VALID [2022-04-14 23:27:29,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {1820#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1820#false} is VALID [2022-04-14 23:27:29,986 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,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324946911] [2022-04-14 23:27:29,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324946911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991123961] [2022-04-14 23:27:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,987 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,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,988 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:30,001 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:30,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,002 INFO L87 Difference]: Start difference. First operand 121 states and 217 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:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,179 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2022-04-14 23:27:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,179 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:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,179 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:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-14 23:27:30,181 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:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-14 23:27:30,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-14 23:27:30,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:30,299 INFO L225 Difference]: With dead ends: 173 [2022-04-14 23:27:30,299 INFO L226 Difference]: Without dead ends: 173 [2022-04-14 23:27:30,299 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,300 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:30,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-14 23:27:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-14 23:27:30,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,305 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,305 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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 173 states and 308 transitions. [2022-04-14 23:27:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 308 transitions. [2022-04-14 23:27:30,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 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 173 states. [2022-04-14 23:27:30,310 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 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 173 states. [2022-04-14 23:27:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,314 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2022-04-14 23:27:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 308 transitions. [2022-04-14 23:27:30,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:30,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2022-04-14 23:27:30,319 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2022-04-14 23:27:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:30,319 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2022-04-14 23:27:30,319 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:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2022-04-14 23:27:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:30,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:30,319 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,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:27:30,320 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1339417396, now seen corresponding path program 1 times [2022-04-14 23:27:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153177146] [2022-04-14 23:27:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {2527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {2521#true} is VALID [2022-04-14 23:27:30,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2521#true} is VALID [2022-04-14 23:27:30,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2521#true} {2521#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {2521#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:30,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {2527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {2521#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2521#true} {2521#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {2521#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {2521#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {2521#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {2521#true} is VALID [2022-04-14 23:27:30,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {2521#true} is VALID [2022-04-14 23:27:30,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {2521#true} [268] L83-->L83-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[] {2521#true} is VALID [2022-04-14 23:27:30,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2521#true} [269] L83-2-->L87-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {2526#(not (= main_~p2~0 0))} [272] L87-1-->L91-1: Formula: (= 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[] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2526#(not (= main_~p2~0 0))} [273] L91-1-->L95-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {2526#(not (= main_~p2~0 0))} [275] L95-1-->L99-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2526#(not (= main_~p2~0 0))} [277] L99-1-->L103-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2526#(not (= main_~p2~0 0))} [279] L103-1-->L107-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2526#(not (= main_~p2~0 0))} [281] L107-1-->L111-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2526#(not (= main_~p2~0 0))} [283] L111-1-->L115-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] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {2526#(not (= main_~p2~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {2526#(not (= main_~p2~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {2526#(not (= main_~p2~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {2526#(not (= main_~p2~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {2526#(not (= main_~p2~0 0))} [294] L131-1-->L137-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[] {2526#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:30,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {2526#(not (= main_~p2~0 0))} [298] L137-1-->L142-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[] {2522#false} is VALID [2022-04-14 23:27:30,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2522#false} [303] L142-1-->L148: Formula: (not (= 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[] {2522#false} is VALID [2022-04-14 23:27:30,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {2522#false} [305] L148-->L198-1: Formula: (not (= v_main_~lk3~0_6 1)) InVars {main_~lk3~0=v_main_~lk3~0_6} OutVars{main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[] {2522#false} is VALID [2022-04-14 23:27:30,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {2522#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#false} is VALID [2022-04-14 23:27:30,390 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,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:30,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153177146] [2022-04-14 23:27:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153177146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:30,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134545237] [2022-04-14 23:27:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:30,391 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,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:30,391 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,403 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,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,404 INFO L87 Difference]: Start difference. First operand 171 states and 307 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,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,562 INFO L93 Difference]: Finished difference Result 175 states and 308 transitions. [2022-04-14 23:27:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,562 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,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,562 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,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:30,564 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,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:30,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-14 23:27:30,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:30,673 INFO L225 Difference]: With dead ends: 175 [2022-04-14 23:27:30,673 INFO L226 Difference]: Without dead ends: 175 [2022-04-14 23:27:30,673 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,674 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:30,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 140 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-14 23:27:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-04-14 23:27:30,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,679 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,679 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,682 INFO L93 Difference]: Finished difference Result 175 states and 308 transitions. [2022-04-14 23:27:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 308 transitions. [2022-04-14 23:27:30,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 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 175 states. [2022-04-14 23:27:30,683 INFO L87 Difference]: Start difference. First operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 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 175 states. [2022-04-14 23:27:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,687 INFO L93 Difference]: Finished difference Result 175 states and 308 transitions. [2022-04-14 23:27:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 308 transitions. [2022-04-14 23:27:30,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:30,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:30,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:30,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 169 states have (on average 1.7988165680473374) internal successors, (304), 169 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call 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,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 307 transitions. [2022-04-14 23:27:30,691 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 307 transitions. Word has length 26 [2022-04-14 23:27:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:30,691 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 307 transitions. [2022-04-14 23:27:30,691 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,691 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 307 transitions. [2022-04-14 23:27:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:30,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:30,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, 1, 1, 1] [2022-04-14 23:27:30,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:27:30,692 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 13892301, now seen corresponding path program 1 times [2022-04-14 23:27:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338173487] [2022-04-14 23:27:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:30,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {3237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {3231#true} is VALID [2022-04-14 23:27:30,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {3231#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3231#true} is VALID [2022-04-14 23:27:30,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3231#true} {3231#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3231#true} is VALID [2022-04-14 23:27:30,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {3231#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:30,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {3231#true} is VALID [2022-04-14 23:27:30,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3231#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3231#true} is VALID [2022-04-14 23:27:30,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3231#true} {3231#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3231#true} is VALID [2022-04-14 23:27:30,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3231#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3231#true} is VALID [2022-04-14 23:27:30,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {3231#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3231#true} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {3231#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {3231#true} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {3231#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {3231#true} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {3231#true} [268] L83-->L83-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[] {3231#true} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {3231#true} [270] L83-2-->L87-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[] {3231#true} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {3231#true} [272] L87-1-->L91-1: Formula: (= 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[] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {3236#(= main_~p3~0 0)} [273] L91-1-->L95-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {3236#(= main_~p3~0 0)} [275] L95-1-->L99-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#(= main_~p3~0 0)} [277] L99-1-->L103-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {3236#(= main_~p3~0 0)} [279] L103-1-->L107-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {3236#(= main_~p3~0 0)} [281] L107-1-->L111-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3236#(= main_~p3~0 0)} [283] L111-1-->L115-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] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3236#(= main_~p3~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {3236#(= main_~p3~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {3236#(= main_~p3~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {3236#(= main_~p3~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {3236#(= main_~p3~0 0)} [294] L131-1-->L137-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[] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {3236#(= main_~p3~0 0)} [298] L137-1-->L142-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[] {3236#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:30,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {3236#(= main_~p3~0 0)} [303] L142-1-->L148: Formula: (not (= 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[] {3232#false} is VALID [2022-04-14 23:27:30,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {3232#false} [305] L148-->L198-1: Formula: (not (= v_main_~lk3~0_6 1)) InVars {main_~lk3~0=v_main_~lk3~0_6} OutVars{main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[] {3232#false} is VALID [2022-04-14 23:27:30,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {3232#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3232#false} is VALID [2022-04-14 23:27:30,756 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,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:30,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338173487] [2022-04-14 23:27:30,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338173487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:30,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:30,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:30,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251691062] [2022-04-14 23:27:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:30,757 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,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:30,757 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,775 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,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:30,776 INFO L87 Difference]: Start difference. First operand 173 states and 307 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,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,948 INFO L93 Difference]: Finished difference Result 331 states and 584 transitions. [2022-04-14 23:27:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,948 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,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,948 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,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:30,950 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,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2022-04-14 23:27:30,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 162 transitions. [2022-04-14 23:27:31,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:31,067 INFO L225 Difference]: With dead ends: 331 [2022-04-14 23:27:31,067 INFO L226 Difference]: Without dead ends: 331 [2022-04-14 23:27:31,067 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,068 INFO L913 BasicCegarLoop]: 91 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:31,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 98 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-14 23:27:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2022-04-14 23:27:31,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:31,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call 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,074 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call 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,075 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call 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,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,080 INFO L93 Difference]: Finished difference Result 331 states and 584 transitions. [2022-04-14 23:27:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 584 transitions. [2022-04-14 23:27:31,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 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 331 states. [2022-04-14 23:27:31,082 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 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 331 states. [2022-04-14 23:27:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,087 INFO L93 Difference]: Finished difference Result 331 states and 584 transitions. [2022-04-14 23:27:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 584 transitions. [2022-04-14 23:27:31,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.7846153846153847) internal successors, (580), 325 states have internal predecessors, (580), 2 states have call successors, (2), 2 states have call 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,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 583 transitions. [2022-04-14 23:27:31,093 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 583 transitions. Word has length 26 [2022-04-14 23:27:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:31,093 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 583 transitions. [2022-04-14 23:27:31,093 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:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 583 transitions. [2022-04-14 23:27:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:31,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:31,094 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:31,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:27:31,094 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash 524426478, now seen corresponding path program 1 times [2022-04-14 23:27:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:31,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498449376] [2022-04-14 23:27:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {4571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {4565#true} is VALID [2022-04-14 23:27:31,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#true} is VALID [2022-04-14 23:27:31,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4565#true} {4565#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#true} is VALID [2022-04-14 23:27:31,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:31,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {4571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {4565#true} is VALID [2022-04-14 23:27:31,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#true} is VALID [2022-04-14 23:27:31,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {4565#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {4565#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {4565#true} [268] L83-->L83-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[] {4565#true} is VALID [2022-04-14 23:27:31,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {4565#true} [270] L83-2-->L87-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[] {4565#true} is VALID [2022-04-14 23:27:31,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {4565#true} [271] L87-1-->L91-1: Formula: (and (not (= v_main_~p3~0_3 0)) (= v_main_~lk3~0_5 1)) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3, main_~lk3~0=v_main_~lk3~0_5} AuxVars[] AssignedVars[main_~lk3~0] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {4570#(= main_~lk3~0 1)} [273] L91-1-->L95-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {4570#(= main_~lk3~0 1)} [275] L95-1-->L99-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {4570#(= main_~lk3~0 1)} [277] L99-1-->L103-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {4570#(= main_~lk3~0 1)} [279] L103-1-->L107-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {4570#(= main_~lk3~0 1)} [281] L107-1-->L111-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {4570#(= main_~lk3~0 1)} [283] L111-1-->L115-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] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {4570#(= main_~lk3~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {4570#(= main_~lk3~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {4570#(= main_~lk3~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {4570#(= main_~lk3~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {4570#(= main_~lk3~0 1)} [294] L131-1-->L137-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[] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {4570#(= main_~lk3~0 1)} [298] L137-1-->L142-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[] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {4570#(= main_~lk3~0 1)} [303] L142-1-->L148: Formula: (not (= 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[] {4570#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:31,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {4570#(= main_~lk3~0 1)} [305] L148-->L198-1: Formula: (not (= v_main_~lk3~0_6 1)) InVars {main_~lk3~0=v_main_~lk3~0_6} OutVars{main_~lk3~0=v_main_~lk3~0_6} AuxVars[] AssignedVars[] {4566#false} is VALID [2022-04-14 23:27:31,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {4566#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4566#false} is VALID [2022-04-14 23:27:31,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:31,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498449376] [2022-04-14 23:27:31,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498449376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:31,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:31,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52659678] [2022-04-14 23:27:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:31,137 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:31,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:31,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:31,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:31,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:31,151 INFO L87 Difference]: Start difference. First operand 329 states and 583 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:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,328 INFO L93 Difference]: Finished difference Result 419 states and 748 transitions. [2022-04-14 23:27:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:31,328 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:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:31,329 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:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-14 23:27:31,330 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:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-14 23:27:31,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-14 23:27:31,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:31,432 INFO L225 Difference]: With dead ends: 419 [2022-04-14 23:27:31,432 INFO L226 Difference]: Without dead ends: 419 [2022-04-14 23:27:31,432 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,432 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:31,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 160 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-14 23:27:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 329. [2022-04-14 23:27:31,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:31,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 2 states have call 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,444 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 2 states have call 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,444 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 2 states have call 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,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,452 INFO L93 Difference]: Finished difference Result 419 states and 748 transitions. [2022-04-14 23:27:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 748 transitions. [2022-04-14 23:27:31,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 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 419 states. [2022-04-14 23:27:31,454 INFO L87 Difference]: Start difference. First operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 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 419 states. [2022-04-14 23:27:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,462 INFO L93 Difference]: Finished difference Result 419 states and 748 transitions. [2022-04-14 23:27:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 748 transitions. [2022-04-14 23:27:31,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.7723076923076924) internal successors, (576), 325 states have internal predecessors, (576), 2 states have call successors, (2), 2 states have call 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,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2022-04-14 23:27:31,469 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 26 [2022-04-14 23:27:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:31,469 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2022-04-14 23:27:31,469 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:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2022-04-14 23:27:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:31,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:31,470 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,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:27:31,470 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 430693653, now seen corresponding path program 1 times [2022-04-14 23:27:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:31,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711919704] [2022-04-14 23:27:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {6169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {6163#true} is VALID [2022-04-14 23:27:31,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {6163#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6163#true} is VALID [2022-04-14 23:27:31,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6163#true} {6163#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6163#true} is VALID [2022-04-14 23:27:31,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {6163#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:31,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {6169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {6163#true} is VALID [2022-04-14 23:27:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {6163#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6163#true} {6163#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {6163#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {6163#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {6163#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {6163#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {6163#true} [268] L83-->L83-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[] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {6163#true} [270] L83-2-->L87-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[] {6163#true} is VALID [2022-04-14 23:27:31,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {6163#true} [272] L87-1-->L91-1: Formula: (= 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[] {6163#true} is VALID [2022-04-14 23:27:31,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {6163#true} [273] L91-1-->L95-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {6168#(= main_~lk4~0 1)} [275] L95-1-->L99-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {6168#(= main_~lk4~0 1)} [277] L99-1-->L103-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {6168#(= main_~lk4~0 1)} [279] L103-1-->L107-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {6168#(= main_~lk4~0 1)} [281] L107-1-->L111-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {6168#(= main_~lk4~0 1)} [283] L111-1-->L115-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] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {6168#(= main_~lk4~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {6168#(= main_~lk4~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {6168#(= main_~lk4~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#(= main_~lk4~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#(= main_~lk4~0 1)} [294] L131-1-->L137-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[] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {6168#(= main_~lk4~0 1)} [298] L137-1-->L142-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[] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {6168#(= main_~lk4~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {6168#(= main_~lk4~0 1)} [307] L147-1-->L153: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {6168#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:31,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {6168#(= main_~lk4~0 1)} [309] L153-->L198-1: Formula: (not (= v_main_~lk4~0_2 1)) InVars {main_~lk4~0=v_main_~lk4~0_2} OutVars{main_~lk4~0=v_main_~lk4~0_2} AuxVars[] AssignedVars[] {6164#false} is VALID [2022-04-14 23:27:31,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {6164#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6164#false} is VALID [2022-04-14 23:27:31,516 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,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:31,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711919704] [2022-04-14 23:27:31,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711919704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:31,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:31,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072707866] [2022-04-14 23:27:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:31,517 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,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:31,517 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,534 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,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:31,535 INFO L87 Difference]: Start difference. First operand 329 states and 579 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,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,701 INFO L93 Difference]: Finished difference Result 615 states and 1092 transitions. [2022-04-14 23:27:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:31,701 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,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:31,701 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,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-14 23:27:31,702 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,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-14 23:27:31,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-14 23:27:31,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:31,811 INFO L225 Difference]: With dead ends: 615 [2022-04-14 23:27:31,811 INFO L226 Difference]: Without dead ends: 615 [2022-04-14 23:27:31,811 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,812 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:31,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 93 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-14 23:27:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 453. [2022-04-14 23:27:31,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:31,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 2 states have call 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,818 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 2 states have call 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,819 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 2 states have call 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,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,831 INFO L93 Difference]: Finished difference Result 615 states and 1092 transitions. [2022-04-14 23:27:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1092 transitions. [2022-04-14 23:27:31,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 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 615 states. [2022-04-14 23:27:31,833 INFO L87 Difference]: Start difference. First operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 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 615 states. [2022-04-14 23:27:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,846 INFO L93 Difference]: Finished difference Result 615 states and 1092 transitions. [2022-04-14 23:27:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1092 transitions. [2022-04-14 23:27:31,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 449 states have (on average 1.7461024498886415) internal successors, (784), 449 states have internal predecessors, (784), 2 states have call successors, (2), 2 states have call 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,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 787 transitions. [2022-04-14 23:27:31,855 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 787 transitions. Word has length 27 [2022-04-14 23:27:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:31,855 INFO L478 AbstractCegarLoop]: Abstraction has 453 states and 787 transitions. [2022-04-14 23:27:31,855 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,855 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 787 transitions. [2022-04-14 23:27:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:31,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:31,856 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,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:27:31,856 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -79840524, now seen corresponding path program 1 times [2022-04-14 23:27:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:31,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429751830] [2022-04-14 23:27:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:31,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {8479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {8473#true} is VALID [2022-04-14 23:27:31,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {8473#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8473#true} is VALID [2022-04-14 23:27:31,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8473#true} {8473#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8473#true} is VALID [2022-04-14 23:27:31,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {8473#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {8479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {8473#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8473#true} {8473#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {8473#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {8473#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {8473#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {8473#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {8473#true} [268] L83-->L83-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[] {8473#true} is VALID [2022-04-14 23:27:31,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {8473#true} [270] L83-2-->L87-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[] {8473#true} is VALID [2022-04-14 23:27:31,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {8473#true} [272] L87-1-->L91-1: Formula: (= 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[] {8473#true} is VALID [2022-04-14 23:27:31,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {8473#true} [274] L91-1-->L95-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[] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {8478#(= main_~p4~0 0)} [275] L95-1-->L99-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] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8478#(= main_~p4~0 0)} [277] L99-1-->L103-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] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {8478#(= main_~p4~0 0)} [279] L103-1-->L107-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] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {8478#(= main_~p4~0 0)} [281] L107-1-->L111-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] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {8478#(= main_~p4~0 0)} [283] L111-1-->L115-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] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {8478#(= main_~p4~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(= main_~p4~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {8478#(= main_~p4~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {8478#(= main_~p4~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {8478#(= main_~p4~0 0)} [294] L131-1-->L137-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[] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {8478#(= main_~p4~0 0)} [298] L137-1-->L142-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[] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {8478#(= main_~p4~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {8478#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:31,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {8478#(= main_~p4~0 0)} [307] L147-1-->L153: Formula: (not (= v_main_~p4~0_2 0)) InVars {main_~p4~0=v_main_~p4~0_2} OutVars{main_~p4~0=v_main_~p4~0_2} AuxVars[] AssignedVars[] {8474#false} is VALID [2022-04-14 23:27:31,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {8474#false} [309] L153-->L198-1: Formula: (not (= v_main_~lk4~0_2 1)) InVars {main_~lk4~0=v_main_~lk4~0_2} OutVars{main_~lk4~0=v_main_~lk4~0_2} AuxVars[] AssignedVars[] {8474#false} is VALID [2022-04-14 23:27:31,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {8474#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8474#false} is VALID [2022-04-14 23:27:31,905 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,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429751830] [2022-04-14 23:27:31,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429751830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787833889] [2022-04-14 23:27:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:31,905 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,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:31,906 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,918 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,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:31,918 INFO L87 Difference]: Start difference. First operand 453 states and 787 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:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,107 INFO L93 Difference]: Finished difference Result 639 states and 1104 transitions. [2022-04-14 23:27:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:32,107 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:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:32,107 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:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-14 23:27:32,108 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:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-14 23:27:32,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-14 23:27:32,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:32,223 INFO L225 Difference]: With dead ends: 639 [2022-04-14 23:27:32,223 INFO L226 Difference]: Without dead ends: 639 [2022-04-14 23:27:32,223 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,224 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:32,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 125 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-04-14 23:27:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 637. [2022-04-14 23:27:32,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:32,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 639 states. Second operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 2 states have call 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,232 INFO L74 IsIncluded]: Start isIncluded. First operand 639 states. Second operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 2 states have call 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,233 INFO L87 Difference]: Start difference. First operand 639 states. Second operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 2 states have call 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,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,246 INFO L93 Difference]: Finished difference Result 639 states and 1104 transitions. [2022-04-14 23:27:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1104 transitions. [2022-04-14 23:27:32,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 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 639 states. [2022-04-14 23:27:32,248 INFO L87 Difference]: Start difference. First operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 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 639 states. [2022-04-14 23:27:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,262 INFO L93 Difference]: Finished difference Result 639 states and 1104 transitions. [2022-04-14 23:27:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1104 transitions. [2022-04-14 23:27:32,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:32,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 633 states have (on average 1.7377567140600316) internal successors, (1100), 633 states have internal predecessors, (1100), 2 states have call successors, (2), 2 states have call 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,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1103 transitions. [2022-04-14 23:27:32,277 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1103 transitions. Word has length 27 [2022-04-14 23:27:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:32,277 INFO L478 AbstractCegarLoop]: Abstraction has 637 states and 1103 transitions. [2022-04-14 23:27:32,277 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:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1103 transitions. [2022-04-14 23:27:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:32,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:32,278 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,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:27:32,278 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 466633801, now seen corresponding path program 1 times [2022-04-14 23:27:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497992280] [2022-04-14 23:27:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {11045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {11039#true} is VALID [2022-04-14 23:27:32,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {11039#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11039#true} is VALID [2022-04-14 23:27:32,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11039#true} {11039#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11039#true} is VALID [2022-04-14 23:27:32,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {11039#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:32,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {11045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {11039#true} is VALID [2022-04-14 23:27:32,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {11039#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11039#true} is VALID [2022-04-14 23:27:32,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11039#true} {11039#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11039#true} is VALID [2022-04-14 23:27:32,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {11039#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11039#true} is VALID [2022-04-14 23:27:32,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {11039#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {11039#true} is VALID [2022-04-14 23:27:32,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {11039#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {11039#true} is VALID [2022-04-14 23:27:32,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {11039#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {11039#true} is VALID [2022-04-14 23:27:32,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {11039#true} [268] L83-->L83-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[] {11039#true} is VALID [2022-04-14 23:27:32,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {11039#true} [270] L83-2-->L87-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[] {11039#true} is VALID [2022-04-14 23:27:32,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {11039#true} [272] L87-1-->L91-1: Formula: (= 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[] {11039#true} is VALID [2022-04-14 23:27:32,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {11039#true} [273] L91-1-->L95-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {11044#(not (= main_~p4~0 0))} [275] L95-1-->L99-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {11044#(not (= main_~p4~0 0))} [277] L99-1-->L103-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {11044#(not (= main_~p4~0 0))} [279] L103-1-->L107-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {11044#(not (= main_~p4~0 0))} [281] L107-1-->L111-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {11044#(not (= main_~p4~0 0))} [283] L111-1-->L115-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] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {11044#(not (= main_~p4~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {11044#(not (= main_~p4~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {11044#(not (= main_~p4~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {11044#(not (= main_~p4~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {11044#(not (= main_~p4~0 0))} [294] L131-1-->L137-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[] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {11044#(not (= main_~p4~0 0))} [298] L137-1-->L142-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[] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {11044#(not (= main_~p4~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {11044#(not (= main_~p4~0 0))} is VALID [2022-04-14 23:27:32,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {11044#(not (= main_~p4~0 0))} [308] L147-1-->L152-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[] {11040#false} is VALID [2022-04-14 23:27:32,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {11040#false} [311] L152-1-->L158: 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[] {11040#false} is VALID [2022-04-14 23:27:32,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {11040#false} [313] L158-->L198-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {11040#false} is VALID [2022-04-14 23:27:32,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {11040#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11040#false} is VALID [2022-04-14 23:27:32,326 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,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497992280] [2022-04-14 23:27:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497992280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:32,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:32,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472796705] [2022-04-14 23:27:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:32,327 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,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:32,328 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,342 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,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:32,343 INFO L87 Difference]: Start difference. First operand 637 states and 1103 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,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,520 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-14 23:27:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:32,520 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,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:32,520 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-04-14 23:27:32,521 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,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2022-04-14 23:27:32,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2022-04-14 23:27:32,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:32,642 INFO L225 Difference]: With dead ends: 651 [2022-04-14 23:27:32,642 INFO L226 Difference]: Without dead ends: 651 [2022-04-14 23:27:32,643 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,643 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:32,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 134 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-14 23:27:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2022-04-14 23:27:32,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:32,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call 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,653 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call 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,654 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call 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,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,669 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-14 23:27:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-14 23:27:32,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 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 651 states. [2022-04-14 23:27:32,671 INFO L87 Difference]: Start difference. First operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 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 651 states. [2022-04-14 23:27:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,686 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2022-04-14 23:27:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1112 transitions. [2022-04-14 23:27:32,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:32,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:32,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:32,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call 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,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2022-04-14 23:27:32,707 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2022-04-14 23:27:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:32,708 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2022-04-14 23:27:32,708 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,708 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2022-04-14 23:27:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:32,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:32,708 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,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:27:32,709 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1819943498, now seen corresponding path program 1 times [2022-04-14 23:27:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487076481] [2022-04-14 23:27:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {13659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {13653#true} is VALID [2022-04-14 23:27:32,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {13653#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13653#true} is VALID [2022-04-14 23:27:32,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13653#true} {13653#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13653#true} is VALID [2022-04-14 23:27:32,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {13653#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:32,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {13659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {13653#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13653#true} {13653#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {13653#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {13653#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {13653#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {13653#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {13653#true} [268] L83-->L83-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[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {13653#true} [270] L83-2-->L87-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[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {13653#true} [272] L87-1-->L91-1: Formula: (= 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[] {13653#true} is VALID [2022-04-14 23:27:32,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {13653#true} [274] L91-1-->L95-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[] {13653#true} is VALID [2022-04-14 23:27:32,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {13653#true} [275] L95-1-->L99-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] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {13658#(= main_~lk5~0 1)} [277] L99-1-->L103-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] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {13658#(= main_~lk5~0 1)} [279] L103-1-->L107-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] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {13658#(= main_~lk5~0 1)} [281] L107-1-->L111-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] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {13658#(= main_~lk5~0 1)} [283] L111-1-->L115-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] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {13658#(= main_~lk5~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {13658#(= main_~lk5~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {13658#(= main_~lk5~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {13658#(= main_~lk5~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {13658#(= main_~lk5~0 1)} [294] L131-1-->L137-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[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {13658#(= main_~lk5~0 1)} [298] L137-1-->L142-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[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {13658#(= main_~lk5~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {13658#(= main_~lk5~0 1)} [308] L147-1-->L152-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[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {13658#(= main_~lk5~0 1)} [311] L152-1-->L158: 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[] {13658#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:32,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {13658#(= main_~lk5~0 1)} [313] L158-->L198-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {13654#false} is VALID [2022-04-14 23:27:32,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {13654#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13654#false} is VALID [2022-04-14 23:27:32,770 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,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:32,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487076481] [2022-04-14 23:27:32,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487076481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:32,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:32,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039964814] [2022-04-14 23:27:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:32,771 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,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:32,771 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,784 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,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:32,785 INFO L87 Difference]: Start difference. First operand 649 states and 1111 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,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:32,982 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-14 23:27:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:32,982 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,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:32,982 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,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:32,984 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,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:27:32,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-14 23:27:33,090 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:33,128 INFO L225 Difference]: With dead ends: 1195 [2022-04-14 23:27:33,129 INFO L226 Difference]: Without dead ends: 1195 [2022-04-14 23:27:33,129 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:33,129 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:33,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-04-14 23:27:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2022-04-14 23:27:33,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:33,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call 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,144 INFO L74 IsIncluded]: Start isIncluded. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call 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,144 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call 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,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,183 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-14 23:27:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-14 23:27:33,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 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 1195 states. [2022-04-14 23:27:33,187 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 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 1195 states. [2022-04-14 23:27:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,227 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2022-04-14 23:27:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2064 transitions. [2022-04-14 23:27:33,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:33,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 2 states have call successors, (2), 2 states have call 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,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2022-04-14 23:27:33,255 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2022-04-14 23:27:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:33,255 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2022-04-14 23:27:33,255 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,255 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2022-04-14 23:27:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:33,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:33,256 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,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:27:33,256 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1309409321, now seen corresponding path program 1 times [2022-04-14 23:27:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967600074] [2022-04-14 23:27:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {18161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {18155#true} is VALID [2022-04-14 23:27:33,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {18155#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#true} is VALID [2022-04-14 23:27:33,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18155#true} {18155#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#true} is VALID [2022-04-14 23:27:33,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {18155#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:33,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {18161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {18155#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18155#true} {18155#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {18155#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {18155#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {18155#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {18155#true} is VALID [2022-04-14 23:27:33,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {18155#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {18155#true} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {18155#true} [268] L83-->L83-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[] {18155#true} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {18155#true} [270] L83-2-->L87-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[] {18155#true} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {18155#true} [272] L87-1-->L91-1: Formula: (= 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[] {18155#true} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {18155#true} [274] L91-1-->L95-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[] {18155#true} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {18155#true} [276] L95-1-->L99-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[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {18160#(= main_~p5~0 0)} [277] L99-1-->L103-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] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {18160#(= main_~p5~0 0)} [279] L103-1-->L107-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] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {18160#(= main_~p5~0 0)} [281] L107-1-->L111-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] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {18160#(= main_~p5~0 0)} [283] L111-1-->L115-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] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {18160#(= main_~p5~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {18160#(= main_~p5~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {18160#(= main_~p5~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {18160#(= main_~p5~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {18160#(= main_~p5~0 0)} [294] L131-1-->L137-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[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {18160#(= main_~p5~0 0)} [298] L137-1-->L142-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[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {18160#(= main_~p5~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {18160#(= main_~p5~0 0)} [308] L147-1-->L152-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[] {18160#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:33,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {18160#(= main_~p5~0 0)} [311] L152-1-->L158: 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[] {18156#false} is VALID [2022-04-14 23:27:33,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {18156#false} [313] L158-->L198-1: Formula: (not (= v_main_~lk5~0_3 1)) InVars {main_~lk5~0=v_main_~lk5~0_3} OutVars{main_~lk5~0=v_main_~lk5~0_3} AuxVars[] AssignedVars[] {18156#false} is VALID [2022-04-14 23:27:33,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {18156#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18156#false} is VALID [2022-04-14 23:27:33,304 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,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:33,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967600074] [2022-04-14 23:27:33,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967600074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:33,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:33,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:33,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219388979] [2022-04-14 23:27:33,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:33,305 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,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:33,305 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,318 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,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:33,319 INFO L87 Difference]: Start difference. First operand 905 states and 1519 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,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,519 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-14 23:27:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:33,519 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,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:33,520 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,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-14 23:27:33,521 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-14 23:27:33,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-14 23:27:33,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:33,653 INFO L225 Difference]: With dead ends: 1259 [2022-04-14 23:27:33,653 INFO L226 Difference]: Without dead ends: 1259 [2022-04-14 23:27:33,653 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:33,654 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:33,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-04-14 23:27:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2022-04-14 23:27:33,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:33,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,671 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,672 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,719 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-14 23:27:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-14 23:27:33,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1259 states. [2022-04-14 23:27:33,723 INFO L87 Difference]: Start difference. First operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1259 states. [2022-04-14 23:27:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,766 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2022-04-14 23:27:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2104 transitions. [2022-04-14 23:27:33,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:33,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:33,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:33,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2022-04-14 23:27:33,810 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2022-04-14 23:27:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:33,810 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2022-04-14 23:27:33,810 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,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2022-04-14 23:27:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:33,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:33,811 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:33,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:27:33,812 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 583706160, now seen corresponding path program 1 times [2022-04-14 23:27:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783754068] [2022-04-14 23:27:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:33,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:33,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {23207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {23201#true} is VALID [2022-04-14 23:27:33,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {23201#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23201#true} is VALID [2022-04-14 23:27:33,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23201#true} {23201#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23201#true} is VALID [2022-04-14 23:27:33,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {23201#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:33,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {23207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {23201#true} is VALID [2022-04-14 23:27:33,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {23201#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23201#true} is VALID [2022-04-14 23:27:33,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23201#true} {23201#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23201#true} is VALID [2022-04-14 23:27:33,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {23201#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {23201#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {23201#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {23201#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {23201#true} [268] L83-->L83-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[] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {23201#true} [270] L83-2-->L87-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[] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {23201#true} [272] L87-1-->L91-1: Formula: (= 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[] {23201#true} is VALID [2022-04-14 23:27:33,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {23201#true} [274] L91-1-->L95-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[] {23201#true} is VALID [2022-04-14 23:27:33,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {23201#true} [275] L95-1-->L99-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] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {23206#(not (= main_~p5~0 0))} [277] L99-1-->L103-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] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {23206#(not (= main_~p5~0 0))} [279] L103-1-->L107-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] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {23206#(not (= main_~p5~0 0))} [281] L107-1-->L111-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] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {23206#(not (= main_~p5~0 0))} [283] L111-1-->L115-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] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {23206#(not (= main_~p5~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {23206#(not (= main_~p5~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {23206#(not (= main_~p5~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {23206#(not (= main_~p5~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {23206#(not (= main_~p5~0 0))} [294] L131-1-->L137-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[] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {23206#(not (= main_~p5~0 0))} [298] L137-1-->L142-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[] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {23206#(not (= main_~p5~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {23206#(not (= main_~p5~0 0))} [308] L147-1-->L152-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[] {23206#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {23206#(not (= main_~p5~0 0))} [312] L152-1-->L157-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[] {23202#false} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {23202#false} [315] L157-1-->L163: 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[] {23202#false} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {23202#false} [317] L163-->L198-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[] {23202#false} is VALID [2022-04-14 23:27:33,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {23202#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23202#false} is VALID [2022-04-14 23:27:33,854 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,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:33,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783754068] [2022-04-14 23:27:33,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783754068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:33,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:33,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316194762] [2022-04-14 23:27:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:33,854 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:33,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:33,855 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:33,868 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:33,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:33,869 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 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,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,062 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-14 23:27:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:34,062 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,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:34,062 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,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-14 23:27:34,063 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,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-14 23:27:34,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-14 23:27:34,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:34,199 INFO L225 Difference]: With dead ends: 1275 [2022-04-14 23:27:34,200 INFO L226 Difference]: Without dead ends: 1275 [2022-04-14 23:27:34,200 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,200 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 131 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:34,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 131 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:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-04-14 23:27:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2022-04-14 23:27:34,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:34,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,215 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,216 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,258 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-14 23:27:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-14 23:27:34,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:34,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:34,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1275 states. [2022-04-14 23:27:34,262 INFO L87 Difference]: Start difference. First operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 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 1275 states. [2022-04-14 23:27:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,305 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2022-04-14 23:27:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2104 transitions. [2022-04-14 23:27:34,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:34,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:34,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:34,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 2 states have call successors, (2), 2 states have call 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2022-04-14 23:27:34,350 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2022-04-14 23:27:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:34,350 INFO L478 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2022-04-14 23:27:34,350 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:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2022-04-14 23:27:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:34,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:34,351 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,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:27:34,352 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1937015857, now seen corresponding path program 1 times [2022-04-14 23:27:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:34,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493474031] [2022-04-14 23:27:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:34,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {28317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {28311#true} is VALID [2022-04-14 23:27:34,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {28311#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28311#true} is VALID [2022-04-14 23:27:34,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28311#true} {28311#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {28311#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:34,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {28317#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {28311#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28311#true} {28311#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {28311#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {28311#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {28311#true} is VALID [2022-04-14 23:27:34,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {28311#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {28311#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {28311#true} [268] L83-->L83-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[] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {28311#true} [270] L83-2-->L87-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[] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {28311#true} [272] L87-1-->L91-1: Formula: (= 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[] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {28311#true} [274] L91-1-->L95-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[] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#true} [276] L95-1-->L99-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[] {28311#true} is VALID [2022-04-14 23:27:34,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {28311#true} [277] L99-1-->L103-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] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {28316#(= main_~lk6~0 1)} [279] L103-1-->L107-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] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {28316#(= main_~lk6~0 1)} [281] L107-1-->L111-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] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {28316#(= main_~lk6~0 1)} [283] L111-1-->L115-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] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {28316#(= main_~lk6~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {28316#(= main_~lk6~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {28316#(= main_~lk6~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {28316#(= main_~lk6~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {28316#(= main_~lk6~0 1)} [294] L131-1-->L137-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[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {28316#(= main_~lk6~0 1)} [298] L137-1-->L142-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[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {28316#(= main_~lk6~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {28316#(= main_~lk6~0 1)} [308] L147-1-->L152-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[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {28316#(= main_~lk6~0 1)} [312] L152-1-->L157-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[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {28316#(= main_~lk6~0 1)} [315] L157-1-->L163: 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[] {28316#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:34,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {28316#(= main_~lk6~0 1)} [317] L163-->L198-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[] {28312#false} is VALID [2022-04-14 23:27:34,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {28312#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28312#false} is VALID [2022-04-14 23:27:34,384 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,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493474031] [2022-04-14 23:27:34,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493474031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:34,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:34,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038090985] [2022-04-14 23:27:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:34,385 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,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:34,385 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,399 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,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:34,400 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 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,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:34,695 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-14 23:27:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:34,695 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,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:34,695 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,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:34,697 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,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:27:34,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-14 23:27:34,801 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:34,934 INFO L225 Difference]: With dead ends: 2315 [2022-04-14 23:27:34,934 INFO L226 Difference]: Without dead ends: 2315 [2022-04-14 23:27:34,934 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,935 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:34,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-14 23:27:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2022-04-14 23:27:34,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:34,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call 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,957 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call 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,959 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call 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,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:35,081 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-14 23:27:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-14 23:27:35,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:35,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:35,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 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,087 INFO L87 Difference]: Start difference. First operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 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,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:35,214 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2022-04-14 23:27:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3864 transitions. [2022-04-14 23:27:35,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:35,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:35,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:35,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 2 states have call successors, (2), 2 states have call 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,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2022-04-14 23:27:35,298 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2022-04-14 23:27:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:35,299 INFO L478 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2022-04-14 23:27:35,299 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,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2022-04-14 23:27:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:35,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:35,301 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,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:27:35,301 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1426481680, now seen corresponding path program 1 times [2022-04-14 23:27:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:35,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116285270] [2022-04-14 23:27:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:35,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {37075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {37069#true} is VALID [2022-04-14 23:27:35,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {37069#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37069#true} is VALID [2022-04-14 23:27:35,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37069#true} {37069#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37069#true} is VALID [2022-04-14 23:27:35,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {37069#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:35,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {37075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {37069#true} is VALID [2022-04-14 23:27:35,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {37069#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37069#true} is VALID [2022-04-14 23:27:35,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37069#true} {37069#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37069#true} is VALID [2022-04-14 23:27:35,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {37069#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {37069#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {37069#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {37069#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {37069#true} [268] L83-->L83-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[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {37069#true} [270] L83-2-->L87-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[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {37069#true} [272] L87-1-->L91-1: Formula: (= 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[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {37069#true} [274] L91-1-->L95-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[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {37069#true} [276] L95-1-->L99-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[] {37069#true} is VALID [2022-04-14 23:27:35,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {37069#true} [278] L99-1-->L103-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[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {37074#(= main_~p6~0 0)} [279] L103-1-->L107-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] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {37074#(= main_~p6~0 0)} [281] L107-1-->L111-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] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {37074#(= main_~p6~0 0)} [283] L111-1-->L115-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] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {37074#(= main_~p6~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {37074#(= main_~p6~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {37074#(= main_~p6~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {37074#(= main_~p6~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {37074#(= main_~p6~0 0)} [294] L131-1-->L137-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[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {37074#(= main_~p6~0 0)} [298] L137-1-->L142-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[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {37074#(= main_~p6~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {37074#(= main_~p6~0 0)} [308] L147-1-->L152-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[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {37074#(= main_~p6~0 0)} [312] L152-1-->L157-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[] {37074#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:35,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {37074#(= main_~p6~0 0)} [315] L157-1-->L163: 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[] {37070#false} is VALID [2022-04-14 23:27:35,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {37070#false} [317] L163-->L198-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[] {37070#false} is VALID [2022-04-14 23:27:35,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {37070#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37070#false} is VALID [2022-04-14 23:27:35,338 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,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:35,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116285270] [2022-04-14 23:27:35,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116285270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:35,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:35,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426364009] [2022-04-14 23:27:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:35,340 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,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:35,341 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,354 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,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:35,355 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 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:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:35,659 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-14 23:27:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:35,659 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,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:35,659 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:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-14 23:27:35,660 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:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-14 23:27:35,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-14 23:27:35,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:35,923 INFO L225 Difference]: With dead ends: 2475 [2022-04-14 23:27:35,924 INFO L226 Difference]: Without dead ends: 2475 [2022-04-14 23:27:35,924 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,924 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:35,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 129 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-04-14 23:27:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2022-04-14 23:27:35,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:35,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,963 INFO L74 IsIncluded]: Start isIncluded. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,965 INFO L87 Difference]: Start difference. First operand 2475 states. Second operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:36,125 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-14 23:27:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-14 23:27:36,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:36,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:36,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2475 states. [2022-04-14 23:27:36,131 INFO L87 Difference]: Start difference. First operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2475 states. [2022-04-14 23:27:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:36,283 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2022-04-14 23:27:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3976 transitions. [2022-04-14 23:27:36,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:36,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:36,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:36,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2022-04-14 23:27:36,431 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2022-04-14 23:27:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:36,432 INFO L478 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2022-04-14 23:27:36,432 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:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2022-04-14 23:27:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:36,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:36,433 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:36,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:27:36,433 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -82017883, now seen corresponding path program 1 times [2022-04-14 23:27:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:36,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789945046] [2022-04-14 23:27:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:36,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {46985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {46979#true} is VALID [2022-04-14 23:27:36,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {46979#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46979#true} is VALID [2022-04-14 23:27:36,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46979#true} {46979#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {46979#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:36,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {46985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {46979#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46979#true} {46979#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {46979#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {46979#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {46979#true} is VALID [2022-04-14 23:27:36,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {46979#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {46979#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {46979#true} [268] L83-->L83-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[] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {46979#true} [270] L83-2-->L87-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[] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {46979#true} [272] L87-1-->L91-1: Formula: (= 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[] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {46979#true} [274] L91-1-->L95-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[] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {46979#true} [276] L95-1-->L99-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[] {46979#true} is VALID [2022-04-14 23:27:36,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {46979#true} [277] L99-1-->L103-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] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {46984#(not (= main_~p6~0 0))} [279] L103-1-->L107-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] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {46984#(not (= main_~p6~0 0))} [281] L107-1-->L111-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] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {46984#(not (= main_~p6~0 0))} [283] L111-1-->L115-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] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {46984#(not (= main_~p6~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {46984#(not (= main_~p6~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {46984#(not (= main_~p6~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {46984#(not (= main_~p6~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {46984#(not (= main_~p6~0 0))} [294] L131-1-->L137-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[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {46984#(not (= main_~p6~0 0))} [298] L137-1-->L142-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[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {46984#(not (= main_~p6~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {46984#(not (= main_~p6~0 0))} [308] L147-1-->L152-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[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {46984#(not (= main_~p6~0 0))} [312] L152-1-->L157-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[] {46984#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:36,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {46984#(not (= main_~p6~0 0))} [316] L157-1-->L162-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[] {46980#false} is VALID [2022-04-14 23:27:36,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {46980#false} [319] L162-1-->L168: 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[] {46980#false} is VALID [2022-04-14 23:27:36,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {46980#false} [321] L168-->L198-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[] {46980#false} is VALID [2022-04-14 23:27:36,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {46980#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46980#false} is VALID [2022-04-14 23:27:36,485 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:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:36,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789945046] [2022-04-14 23:27:36,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789945046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:36,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:36,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939975990] [2022-04-14 23:27:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:36,486 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:36,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:36,486 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:36,502 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:36,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:36,503 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 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:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:36,810 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-14 23:27:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:36,810 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:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:36,810 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:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-14 23:27:36,811 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:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-14 23:27:36,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-14 23:27:36,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:37,062 INFO L225 Difference]: With dead ends: 2507 [2022-04-14 23:27:37,062 INFO L226 Difference]: Without dead ends: 2507 [2022-04-14 23:27:37,062 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:37,063 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 128 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:37,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 128 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:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-14 23:27:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2022-04-14 23:27:37,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:37,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,092 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,094 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:37,236 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-14 23:27:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-14 23:27:37,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:37,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:37,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2507 states. [2022-04-14 23:27:37,243 INFO L87 Difference]: Start difference. First operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 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 2507 states. [2022-04-14 23:27:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:37,408 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2022-04-14 23:27:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3976 transitions. [2022-04-14 23:27:37,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:37,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:37,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:37,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 2 states have call successors, (2), 2 states have call 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,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2022-04-14 23:27:37,561 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2022-04-14 23:27:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:37,561 INFO L478 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2022-04-14 23:27:37,562 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:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2022-04-14 23:27:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:37,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:37,563 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:37,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:27:37,563 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1271291814, now seen corresponding path program 1 times [2022-04-14 23:27:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:37,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537368061] [2022-04-14 23:27:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:37,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {57023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {57017#true} is VALID [2022-04-14 23:27:37,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {57017#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57017#true} is VALID [2022-04-14 23:27:37,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57017#true} {57017#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57017#true} is VALID [2022-04-14 23:27:37,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {57017#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:37,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {57023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {57017#true} is VALID [2022-04-14 23:27:37,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {57017#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57017#true} is VALID [2022-04-14 23:27:37,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57017#true} {57017#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57017#true} is VALID [2022-04-14 23:27:37,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {57017#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {57017#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {57017#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {57017#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {57017#true} [268] L83-->L83-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[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {57017#true} [270] L83-2-->L87-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[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {57017#true} [272] L87-1-->L91-1: Formula: (= 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[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {57017#true} [274] L91-1-->L95-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[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {57017#true} [276] L95-1-->L99-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[] {57017#true} is VALID [2022-04-14 23:27:37,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {57017#true} [278] L99-1-->L103-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[] {57017#true} is VALID [2022-04-14 23:27:37,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {57017#true} [279] L103-1-->L107-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] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {57022#(= main_~lk7~0 1)} [281] L107-1-->L111-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] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {57022#(= main_~lk7~0 1)} [283] L111-1-->L115-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] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {57022#(= main_~lk7~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {57022#(= main_~lk7~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {57022#(= main_~lk7~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {57022#(= main_~lk7~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {57022#(= main_~lk7~0 1)} [294] L131-1-->L137-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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {57022#(= main_~lk7~0 1)} [298] L137-1-->L142-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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {57022#(= main_~lk7~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {57022#(= main_~lk7~0 1)} [308] L147-1-->L152-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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {57022#(= main_~lk7~0 1)} [312] L152-1-->L157-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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {57022#(= main_~lk7~0 1)} [316] L157-1-->L162-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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {57022#(= main_~lk7~0 1)} [319] L162-1-->L168: 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[] {57022#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:37,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {57022#(= main_~lk7~0 1)} [321] L168-->L198-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[] {57018#false} is VALID [2022-04-14 23:27:37,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {57018#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57018#false} is VALID [2022-04-14 23:27:37,598 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:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:37,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537368061] [2022-04-14 23:27:37,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537368061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:37,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:37,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107927381] [2022-04-14 23:27:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:37,599 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:37,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:37,599 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:37,613 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:37,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:37,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:37,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:37,614 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 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:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:38,257 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-14 23:27:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:38,258 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:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:38,258 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:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:38,259 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:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-14 23:27:38,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-14 23:27:38,351 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:38,893 INFO L225 Difference]: With dead ends: 4491 [2022-04-14 23:27:38,893 INFO L226 Difference]: Without dead ends: 4491 [2022-04-14 23:27:38,893 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:38,893 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:38,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 90 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-14 23:27:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2022-04-14 23:27:38,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:38,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call 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,939 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call 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,941 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call 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,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:39,429 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-14 23:27:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-14 23:27:39,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:39,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:39,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 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:39,438 INFO L87 Difference]: Start difference. First operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 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:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:39,947 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2022-04-14 23:27:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 7208 transitions. [2022-04-14 23:27:39,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:39,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:39,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:39,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 2 states have call successors, (2), 2 states have call 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,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2022-04-14 23:27:40,327 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2022-04-14 23:27:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:40,327 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2022-04-14 23:27:40,327 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:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2022-04-14 23:27:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:40,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:40,329 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:40,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 23:27:40,330 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 760757637, now seen corresponding path program 1 times [2022-04-14 23:27:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:40,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67105044] [2022-04-14 23:27:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {74101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {74095#true} is VALID [2022-04-14 23:27:40,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {74095#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74095#true} is VALID [2022-04-14 23:27:40,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74095#true} {74095#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74095#true} is VALID [2022-04-14 23:27:40,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {74095#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:40,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {74101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {74095#true} is VALID [2022-04-14 23:27:40,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {74095#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74095#true} is VALID [2022-04-14 23:27:40,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74095#true} {74095#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74095#true} is VALID [2022-04-14 23:27:40,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {74095#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {74095#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {74095#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {74095#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {74095#true} [268] L83-->L83-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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {74095#true} [270] L83-2-->L87-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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {74095#true} [272] L87-1-->L91-1: Formula: (= 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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {74095#true} [274] L91-1-->L95-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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {74095#true} [276] L95-1-->L99-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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {74095#true} [278] L99-1-->L103-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[] {74095#true} is VALID [2022-04-14 23:27:40,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {74095#true} [280] L103-1-->L107-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {74100#(= main_~p7~0 0)} [281] L107-1-->L111-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] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {74100#(= main_~p7~0 0)} [283] L111-1-->L115-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] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {74100#(= main_~p7~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {74100#(= main_~p7~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {74100#(= main_~p7~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {74100#(= main_~p7~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {74100#(= main_~p7~0 0)} [294] L131-1-->L137-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {74100#(= main_~p7~0 0)} [298] L137-1-->L142-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {74100#(= main_~p7~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {74100#(= main_~p7~0 0)} [308] L147-1-->L152-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {74100#(= main_~p7~0 0)} [312] L152-1-->L157-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {74100#(= main_~p7~0 0)} [316] L157-1-->L162-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[] {74100#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:40,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {74100#(= main_~p7~0 0)} [319] L162-1-->L168: 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[] {74096#false} is VALID [2022-04-14 23:27:40,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {74096#false} [321] L168-->L198-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[] {74096#false} is VALID [2022-04-14 23:27:40,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {74096#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74096#false} is VALID [2022-04-14 23:27:40,360 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:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:40,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67105044] [2022-04-14 23:27:40,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67105044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286662235] [2022-04-14 23:27:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:40,361 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:40,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:40,361 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:40,376 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:40,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:40,376 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 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:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:41,152 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-14 23:27:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:41,152 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,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:41,152 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:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-14 23:27:41,153 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:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-04-14 23:27:41,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2022-04-14 23:27:41,247 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:41,890 INFO L225 Difference]: With dead ends: 4875 [2022-04-14 23:27:41,890 INFO L226 Difference]: Without dead ends: 4875 [2022-04-14 23:27:41,890 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:41,890 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 131 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:41,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 131 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:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-14 23:27:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2022-04-14 23:27:41,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:41,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,960 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,962 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:42,529 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-14 23:27:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-14 23:27:42,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:42,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:42,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 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 4875 states. [2022-04-14 23:27:42,539 INFO L87 Difference]: Start difference. First operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 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 4875 states. [2022-04-14 23:27:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:43,115 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2022-04-14 23:27:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7496 transitions. [2022-04-14 23:27:43,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:43,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:43,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:43,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2022-04-14 23:27:43,709 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2022-04-14 23:27:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:43,709 INFO L478 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2022-04-14 23:27:43,709 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:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2022-04-14 23:27:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:27:43,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:43,712 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:27:43,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 23:27:43,712 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:43,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 755373388, now seen corresponding path program 1 times [2022-04-14 23:27:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:43,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854758138] [2022-04-14 23:27:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:43,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {93611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {93605#true} is VALID [2022-04-14 23:27:43,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {93605#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93605#true} is VALID [2022-04-14 23:27:43,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93605#true} {93605#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93605#true} is VALID [2022-04-14 23:27:43,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {93605#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {93611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {93605#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93605#true} {93605#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {93605#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {93605#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {93605#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {93605#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {93605#true} [268] L83-->L83-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[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {93605#true} [270] L83-2-->L87-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[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {93605#true} [272] L87-1-->L91-1: Formula: (= 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[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {93605#true} [274] L91-1-->L95-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[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {93605#true} [276] L95-1-->L99-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[] {93605#true} is VALID [2022-04-14 23:27:43,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {93605#true} [278] L99-1-->L103-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[] {93605#true} is VALID [2022-04-14 23:27:43,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {93605#true} [279] L103-1-->L107-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] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {93610#(not (= main_~p7~0 0))} [281] L107-1-->L111-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] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {93610#(not (= main_~p7~0 0))} [283] L111-1-->L115-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] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {93610#(not (= main_~p7~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {93610#(not (= main_~p7~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {93610#(not (= main_~p7~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {93610#(not (= main_~p7~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {93610#(not (= main_~p7~0 0))} [294] L131-1-->L137-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[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {93610#(not (= main_~p7~0 0))} [298] L137-1-->L142-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[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {93610#(not (= main_~p7~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {93610#(not (= main_~p7~0 0))} [308] L147-1-->L152-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[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {93610#(not (= main_~p7~0 0))} [312] L152-1-->L157-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[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {93610#(not (= main_~p7~0 0))} [316] L157-1-->L162-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[] {93610#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:43,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {93610#(not (= main_~p7~0 0))} [320] L162-1-->L167-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[] {93606#false} is VALID [2022-04-14 23:27:43,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {93606#false} [323] L167-1-->L173: 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[] {93606#false} is VALID [2022-04-14 23:27:43,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {93606#false} [325] L173-->L198-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[] {93606#false} is VALID [2022-04-14 23:27:43,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {93606#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93606#false} is VALID [2022-04-14 23:27:43,743 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:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854758138] [2022-04-14 23:27:43,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854758138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:43,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991233913] [2022-04-14 23:27:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:43,744 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:27:43,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:43,744 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:27:43,758 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:27:43,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:43,759 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 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:27:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:44,514 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-14 23:27:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:44,515 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:27:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:44,515 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:27:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-14 23:27:44,516 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:27:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-04-14 23:27:44,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 152 transitions. [2022-04-14 23:27:44,610 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:45,275 INFO L225 Difference]: With dead ends: 4939 [2022-04-14 23:27:45,275 INFO L226 Difference]: Without dead ends: 4939 [2022-04-14 23:27:45,276 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:45,276 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 125 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:45,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 125 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-04-14 23:27:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2022-04-14 23:27:45,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:45,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,332 INFO L74 IsIncluded]: Start isIncluded. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,336 INFO L87 Difference]: Start difference. First operand 4939 states. Second operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:45,917 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-14 23:27:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-14 23:27:45,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:45,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:45,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 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 4939 states. [2022-04-14 23:27:45,932 INFO L87 Difference]: Start difference. First operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 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 4939 states. [2022-04-14 23:27:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:46,521 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2022-04-14 23:27:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7496 transitions. [2022-04-14 23:27:46,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:46,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:46,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:46,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2022-04-14 23:27:47,192 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2022-04-14 23:27:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:47,192 INFO L478 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2022-04-14 23:27:47,192 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:27:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2022-04-14 23:27:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:27:47,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:47,194 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:27:47,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 23:27:47,194 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2108683085, now seen corresponding path program 1 times [2022-04-14 23:27:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:47,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308177365] [2022-04-14 23:27:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:47,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {113377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {113371#true} is VALID [2022-04-14 23:27:47,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {113371#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113371#true} is VALID [2022-04-14 23:27:47,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113371#true} {113371#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {113371#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {113377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {113371#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113371#true} {113371#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {113371#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {113371#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {113371#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {113371#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {113371#true} [268] L83-->L83-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[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {113371#true} [270] L83-2-->L87-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[] {113371#true} is VALID [2022-04-14 23:27:47,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {113371#true} [272] L87-1-->L91-1: Formula: (= 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[] {113371#true} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {113371#true} [274] L91-1-->L95-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[] {113371#true} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {113371#true} [276] L95-1-->L99-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[] {113371#true} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {113371#true} [278] L99-1-->L103-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[] {113371#true} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {113371#true} [280] L103-1-->L107-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[] {113371#true} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {113371#true} [281] L107-1-->L111-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] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {113376#(= main_~lk8~0 1)} [283] L111-1-->L115-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] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {113376#(= main_~lk8~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {113376#(= main_~lk8~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {113376#(= main_~lk8~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {113376#(= main_~lk8~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {113376#(= main_~lk8~0 1)} [294] L131-1-->L137-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {113376#(= main_~lk8~0 1)} [298] L137-1-->L142-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {113376#(= main_~lk8~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {113376#(= main_~lk8~0 1)} [308] L147-1-->L152-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {113376#(= main_~lk8~0 1)} [312] L152-1-->L157-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {113376#(= main_~lk8~0 1)} [316] L157-1-->L162-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {113376#(= main_~lk8~0 1)} [320] L162-1-->L167-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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {113376#(= main_~lk8~0 1)} [323] L167-1-->L173: 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[] {113376#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:47,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {113376#(= main_~lk8~0 1)} [325] L173-->L198-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[] {113372#false} is VALID [2022-04-14 23:27:47,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {113372#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113372#false} is VALID [2022-04-14 23:27:47,237 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:47,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:47,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308177365] [2022-04-14 23:27:47,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308177365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:47,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:47,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854208940] [2022-04-14 23:27:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:47,238 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:27:47,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:47,238 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:27:47,254 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:27:47,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:47,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:47,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:47,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:47,255 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 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:27:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:49,217 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-14 23:27:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:49,217 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:27:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:49,218 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:27:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:49,219 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:27:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:49,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-14 23:27:49,316 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:51,207 INFO L225 Difference]: With dead ends: 8715 [2022-04-14 23:27:51,207 INFO L226 Difference]: Without dead ends: 8715 [2022-04-14 23:27:51,207 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:51,208 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:51,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2022-04-14 23:27:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2022-04-14 23:27:51,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:51,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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,271 INFO L74 IsIncluded]: Start isIncluded. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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,276 INFO L87 Difference]: Start difference. First operand 8715 states. Second operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:53,194 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-14 23:27:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-14 23:27:53,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:53,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:53,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 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 8715 states. [2022-04-14 23:27:53,211 INFO L87 Difference]: Start difference. First operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 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 8715 states. [2022-04-14 23:27:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:54,952 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2022-04-14 23:27:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 13384 transitions. [2022-04-14 23:27:54,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:54,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:54,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:54,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 2 states have call successors, (2), 2 states have call 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:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2022-04-14 23:27:56,342 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2022-04-14 23:27:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:56,342 INFO L478 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2022-04-14 23:27:56,342 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:27:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2022-04-14 23:27:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:27:56,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:56,345 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:27:56,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 23:27:56,346 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1598148908, now seen corresponding path program 1 times [2022-04-14 23:27:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:56,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037271159] [2022-04-14 23:27:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:56,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {146711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {146705#true} is VALID [2022-04-14 23:27:56,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {146705#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146705#true} is VALID [2022-04-14 23:27:56,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146705#true} {146705#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146705#true} is VALID [2022-04-14 23:27:56,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {146705#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:56,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {146711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {146705#true} is VALID [2022-04-14 23:27:56,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {146705#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146705#true} is VALID [2022-04-14 23:27:56,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146705#true} {146705#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {146705#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {146705#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {146705#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {146705#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {146705#true} [268] L83-->L83-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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {146705#true} [270] L83-2-->L87-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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {146705#true} [272] L87-1-->L91-1: Formula: (= 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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {146705#true} [274] L91-1-->L95-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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {146705#true} [276] L95-1-->L99-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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {146705#true} [278] L99-1-->L103-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[] {146705#true} is VALID [2022-04-14 23:27:56,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {146705#true} [280] L103-1-->L107-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[] {146705#true} is VALID [2022-04-14 23:27:56,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {146705#true} [282] L107-1-->L111-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {146710#(= main_~p8~0 0)} [283] L111-1-->L115-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] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {146710#(= main_~p8~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {146710#(= main_~p8~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {146710#(= main_~p8~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {146710#(= main_~p8~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {146710#(= main_~p8~0 0)} [294] L131-1-->L137-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {146710#(= main_~p8~0 0)} [298] L137-1-->L142-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {146710#(= main_~p8~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {146710#(= main_~p8~0 0)} [308] L147-1-->L152-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {146710#(= main_~p8~0 0)} [312] L152-1-->L157-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {146710#(= main_~p8~0 0)} [316] L157-1-->L162-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {146710#(= main_~p8~0 0)} [320] L162-1-->L167-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[] {146710#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:56,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {146710#(= main_~p8~0 0)} [323] L167-1-->L173: 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[] {146706#false} is VALID [2022-04-14 23:27:56,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {146706#false} [325] L173-->L198-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[] {146706#false} is VALID [2022-04-14 23:27:56,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {146706#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146706#false} is VALID [2022-04-14 23:27:56,379 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:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:56,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037271159] [2022-04-14 23:27:56,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037271159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:56,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:56,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441697426] [2022-04-14 23:27:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:56,380 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:27:56,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:56,380 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:27:56,393 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:27:56,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:56,394 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 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:27:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:58,916 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-14 23:27:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:58,916 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:27:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:58,916 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:27:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-14 23:27:58,918 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:27:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-14 23:27:58,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-14 23:27:59,011 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:28:01,694 INFO L225 Difference]: With dead ends: 9611 [2022-04-14 23:28:01,694 INFO L226 Difference]: Without dead ends: 9611 [2022-04-14 23:28:01,695 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:01,696 INFO L913 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 133 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:28:01,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 133 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2022-04-14 23:28:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2022-04-14 23:28:01,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:01,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:01,794 INFO L74 IsIncluded]: Start isIncluded. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:01,802 INFO L87 Difference]: Start difference. First operand 9611 states. Second operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:04,211 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-14 23:28:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-14 23:28:04,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:04,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:04,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9611 states. [2022-04-14 23:28:04,235 INFO L87 Difference]: Start difference. First operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9611 states. [2022-04-14 23:28:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:06,288 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2022-04-14 23:28:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9611 states and 14088 transitions. [2022-04-14 23:28:06,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:06,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:06,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:06,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2022-04-14 23:28:08,654 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2022-04-14 23:28:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:08,655 INFO L478 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2022-04-14 23:28:08,655 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:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2022-04-14 23:28:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:28:08,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:08,658 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:28:08,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 23:28:08,658 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash 944699137, now seen corresponding path program 1 times [2022-04-14 23:28:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136378809] [2022-04-14 23:28:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:08,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {185165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {185159#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185159#true} {185159#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {185159#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:08,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {185165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {185159#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185159#true} {185159#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185159#true} is VALID [2022-04-14 23:28:08,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {185159#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {185159#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {185159#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {185159#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {185159#true} [268] L83-->L83-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {185159#true} [270] L83-2-->L87-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {185159#true} [272] L87-1-->L91-1: Formula: (= 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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {185159#true} [274] L91-1-->L95-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {185159#true} [276] L95-1-->L99-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {185159#true} [278] L99-1-->L103-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {185159#true} [280] L103-1-->L107-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[] {185159#true} is VALID [2022-04-14 23:28:08,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {185159#true} [281] L107-1-->L111-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] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {185164#(not (= main_~p8~0 0))} [283] L111-1-->L115-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] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {185164#(not (= main_~p8~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {185164#(not (= main_~p8~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {185164#(not (= main_~p8~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {185164#(not (= main_~p8~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {185164#(not (= main_~p8~0 0))} [294] L131-1-->L137-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {185164#(not (= main_~p8~0 0))} [298] L137-1-->L142-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {185164#(not (= main_~p8~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {185164#(not (= main_~p8~0 0))} [308] L147-1-->L152-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {185164#(not (= main_~p8~0 0))} [312] L152-1-->L157-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {185164#(not (= main_~p8~0 0))} [316] L157-1-->L162-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {185164#(not (= main_~p8~0 0))} [320] L162-1-->L167-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[] {185164#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:28:08,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {185164#(not (= main_~p8~0 0))} [324] L167-1-->L172-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[] {185160#false} is VALID [2022-04-14 23:28:08,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {185160#false} [327] L172-1-->L178: 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[] {185160#false} is VALID [2022-04-14 23:28:08,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {185160#false} [329] L178-->L198-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[] {185160#false} is VALID [2022-04-14 23:28:08,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {185160#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185160#false} is VALID [2022-04-14 23:28:08,698 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:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136378809] [2022-04-14 23:28:08,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136378809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:08,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:08,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009730363] [2022-04-14 23:28:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:08,699 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:28:08,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:08,699 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:28:08,716 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:28:08,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:08,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:08,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:08,717 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 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:28:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:11,250 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-14 23:28:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:11,250 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:28:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:11,250 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:28:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:28:11,251 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:28:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-14 23:28:11,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-14 23:28:11,358 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:28:13,880 INFO L225 Difference]: With dead ends: 9739 [2022-04-14 23:28:13,880 INFO L226 Difference]: Without dead ends: 9739 [2022-04-14 23:28:13,881 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:13,881 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 122 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:28:13,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 122 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2022-04-14 23:28:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2022-04-14 23:28:13,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:13,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:13,974 INFO L74 IsIncluded]: Start isIncluded. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:13,985 INFO L87 Difference]: Start difference. First operand 9739 states. Second operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:16,130 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-14 23:28:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-14 23:28:16,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:16,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:16,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9739 states. [2022-04-14 23:28:16,148 INFO L87 Difference]: Start difference. First operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 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 9739 states. [2022-04-14 23:28:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:18,531 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2022-04-14 23:28:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 14088 transitions. [2022-04-14 23:28:18,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:18,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:18,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:18,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 2 states have call successors, (2), 2 states have call 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:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2022-04-14 23:28:20,956 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2022-04-14 23:28:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:20,956 INFO L478 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2022-04-14 23:28:20,956 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:28:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2022-04-14 23:28:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:28:20,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:20,959 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:28:20,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 23:28:20,960 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1996958462, now seen corresponding path program 1 times [2022-04-14 23:28:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704939] [2022-04-14 23:28:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:21,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {224131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {224125#true} is VALID [2022-04-14 23:28:21,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {224125#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224125#true} is VALID [2022-04-14 23:28:21,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224125#true} {224125#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {224125#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:21,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {224131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {224125#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224125#true} {224125#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {224125#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {224125#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {224125#true} is VALID [2022-04-14 23:28:21,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {224125#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {224125#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {224125#true} [268] L83-->L83-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {224125#true} [270] L83-2-->L87-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {224125#true} [272] L87-1-->L91-1: Formula: (= 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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {224125#true} [274] L91-1-->L95-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {224125#true} [276] L95-1-->L99-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {224125#true} [278] L99-1-->L103-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {224125#true} [280] L103-1-->L107-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[] {224125#true} is VALID [2022-04-14 23:28:21,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {224125#true} [282] L107-1-->L111-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[] {224125#true} is VALID [2022-04-14 23:28:21,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {224125#true} [283] L111-1-->L115-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] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {224130#(= main_~lk9~0 1)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {224130#(= main_~lk9~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {224130#(= main_~lk9~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {224130#(= main_~lk9~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {224130#(= main_~lk9~0 1)} [294] L131-1-->L137-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {224130#(= main_~lk9~0 1)} [298] L137-1-->L142-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {224130#(= main_~lk9~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {224130#(= main_~lk9~0 1)} [308] L147-1-->L152-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {224130#(= main_~lk9~0 1)} [312] L152-1-->L157-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {224130#(= main_~lk9~0 1)} [316] L157-1-->L162-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {224130#(= main_~lk9~0 1)} [320] L162-1-->L167-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {224130#(= main_~lk9~0 1)} [324] L167-1-->L172-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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {224130#(= main_~lk9~0 1)} [327] L172-1-->L178: 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[] {224130#(= main_~lk9~0 1)} is VALID [2022-04-14 23:28:21,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {224130#(= main_~lk9~0 1)} [329] L178-->L198-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[] {224126#false} is VALID [2022-04-14 23:28:21,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {224126#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224126#false} is VALID [2022-04-14 23:28:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:28:21,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:21,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704939] [2022-04-14 23:28:21,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:21,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:21,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865651506] [2022-04-14 23:28:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:21,012 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:28:21,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:21,013 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:28:21,046 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:28:21,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:21,046 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 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:28:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:28,611 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-14 23:28:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:28,611 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:28:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:28,611 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:28:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:28:28,612 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:28:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:28:28,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-14 23:28:28,691 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:28:35,732 INFO L225 Difference]: With dead ends: 16907 [2022-04-14 23:28:35,733 INFO L226 Difference]: Without dead ends: 16907 [2022-04-14 23:28:35,733 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:35,733 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 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:28:35,733 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 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:28:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2022-04-14 23:28:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2022-04-14 23:28:35,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:35,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:35,876 INFO L74 IsIncluded]: Start isIncluded. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:35,886 INFO L87 Difference]: Start difference. First operand 16907 states. Second operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:42,899 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-14 23:28:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-14 23:28:42,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:42,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:42,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 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 16907 states. [2022-04-14 23:28:42,965 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 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 16907 states. [2022-04-14 23:28:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:49,883 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2022-04-14 23:28:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 24712 transitions. [2022-04-14 23:28:49,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:49,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:49,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:49,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 2 states have call successors, (2), 2 states have call 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:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2022-04-14 23:28:55,812 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2022-04-14 23:28:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:55,812 INFO L478 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2022-04-14 23:28:55,812 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:28:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2022-04-14 23:28:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:28:55,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:55,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, 1, 1] [2022-04-14 23:28:55,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 23:28:55,829 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1787474657, now seen corresponding path program 1 times [2022-04-14 23:28:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:55,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734221823] [2022-04-14 23:28:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:55,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {289209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {289203#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289203#true} {289203#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {289203#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:55,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {289209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {289203#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289203#true} {289203#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289203#true} is VALID [2022-04-14 23:28:55,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {289203#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {289203#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {289203#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {289203#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {289203#true} [268] L83-->L83-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {289203#true} [270] L83-2-->L87-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {289203#true} [272] L87-1-->L91-1: Formula: (= 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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {289203#true} [274] L91-1-->L95-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {289203#true} [276] L95-1-->L99-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {289203#true} [278] L99-1-->L103-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {289203#true} [280] L103-1-->L107-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[] {289203#true} is VALID [2022-04-14 23:28:55,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {289203#true} [282] L107-1-->L111-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[] {289203#true} is VALID [2022-04-14 23:28:55,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {289203#true} [284] L111-1-->L115-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {289208#(= main_~p9~0 0)} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {289208#(= main_~p9~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {289208#(= main_~p9~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {289208#(= main_~p9~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {289208#(= main_~p9~0 0)} [294] L131-1-->L137-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {289208#(= main_~p9~0 0)} [298] L137-1-->L142-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {289208#(= main_~p9~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {289208#(= main_~p9~0 0)} [308] L147-1-->L152-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {289208#(= main_~p9~0 0)} [312] L152-1-->L157-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {289208#(= main_~p9~0 0)} [316] L157-1-->L162-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {289208#(= main_~p9~0 0)} [320] L162-1-->L167-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {289208#(= main_~p9~0 0)} [324] L167-1-->L172-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[] {289208#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:55,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {289208#(= main_~p9~0 0)} [327] L172-1-->L178: 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[] {289204#false} is VALID [2022-04-14 23:28:55,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {289204#false} [329] L178-->L198-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[] {289204#false} is VALID [2022-04-14 23:28:55,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {289204#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {289204#false} is VALID [2022-04-14 23:28:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:28:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:55,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734221823] [2022-04-14 23:28:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734221823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:55,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:55,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288165214] [2022-04-14 23:28:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:55,865 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:28:55,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:55,865 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:28:55,879 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:28:55,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:55,880 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 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:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:04,692 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-14 23:29:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:04,692 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:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:04,692 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:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-14 23:29:04,693 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:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-04-14 23:29:04,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 149 transitions. [2022-04-14 23:29:04,799 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:29:14,391 INFO L225 Difference]: With dead ends: 18955 [2022-04-14 23:29:14,391 INFO L226 Difference]: Without dead ends: 18955 [2022-04-14 23:29:14,391 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:14,392 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 135 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:29:14,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 135 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2022-04-14 23:29:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2022-04-14 23:29:14,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:14,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:14,569 INFO L74 IsIncluded]: Start isIncluded. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:14,591 INFO L87 Difference]: Start difference. First operand 18955 states. Second operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:22,838 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-14 23:29:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-14 23:29:22,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:22,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:22,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 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 18955 states. [2022-04-14 23:29:22,876 INFO L87 Difference]: Start difference. First operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 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 18955 states. [2022-04-14 23:29:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:30,920 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2022-04-14 23:29:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 26376 transitions. [2022-04-14 23:29:30,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:30,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:30,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:30,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2022-04-14 23:29:41,559 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2022-04-14 23:29:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:41,559 INFO L478 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2022-04-14 23:29:41,559 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:29:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2022-04-14 23:29:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 23:29:41,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:41,565 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:29:41,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 23:29:41,565 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1776137112, now seen corresponding path program 1 times [2022-04-14 23:29:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:41,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301124772] [2022-04-14 23:29:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:41,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {365039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {365033#true} is VALID [2022-04-14 23:29:41,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {365033#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365033#true} is VALID [2022-04-14 23:29:41,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {365033#true} {365033#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365033#true} is VALID [2022-04-14 23:29:41,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {365033#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {365039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {365033#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365033#true} {365033#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {365033#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {365033#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {365033#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {365033#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {365033#true} [268] L83-->L83-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[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {365033#true} [270] L83-2-->L87-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[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {365033#true} [272] L87-1-->L91-1: Formula: (= 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[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {365033#true} [274] L91-1-->L95-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[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {365033#true} [276] L95-1-->L99-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[] {365033#true} is VALID [2022-04-14 23:29:41,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {365033#true} [278] L99-1-->L103-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[] {365033#true} is VALID [2022-04-14 23:29:41,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {365033#true} [280] L103-1-->L107-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[] {365033#true} is VALID [2022-04-14 23:29:41,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {365033#true} [282] L107-1-->L111-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[] {365033#true} is VALID [2022-04-14 23:29:41,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {365033#true} [283] L111-1-->L115-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] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {365038#(not (= main_~p9~0 0))} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {365038#(not (= main_~p9~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {365038#(not (= main_~p9~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {365038#(not (= main_~p9~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {365038#(not (= main_~p9~0 0))} [294] L131-1-->L137-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {365038#(not (= main_~p9~0 0))} [298] L137-1-->L142-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {365038#(not (= main_~p9~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {365038#(not (= main_~p9~0 0))} [308] L147-1-->L152-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {365038#(not (= main_~p9~0 0))} [312] L152-1-->L157-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {365038#(not (= main_~p9~0 0))} [316] L157-1-->L162-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {365038#(not (= main_~p9~0 0))} [320] L162-1-->L167-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {365038#(not (= main_~p9~0 0))} [324] L167-1-->L172-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[] {365038#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:41,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {365038#(not (= main_~p9~0 0))} [328] L172-1-->L177-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[] {365034#false} is VALID [2022-04-14 23:29:41,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {365034#false} [331] L177-1-->L183: 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[] {365034#false} is VALID [2022-04-14 23:29:41,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {365034#false} [333] L183-->L198-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[] {365034#false} is VALID [2022-04-14 23:29:41,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {365034#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {365034#false} is VALID [2022-04-14 23:29:41,622 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:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:41,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301124772] [2022-04-14 23:29:41,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301124772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:41,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:41,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:41,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036504330] [2022-04-14 23:29:41,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:41,623 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:29:41,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:41,623 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:29:41,653 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:29:41,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:41,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:41,654 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 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:29:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:51,299 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-14 23:29:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:51,299 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:29:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:51,300 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:29:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-14 23:29:51,300 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:29:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-14 23:29:51,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-14 23:29:51,388 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:29:59,922 INFO L225 Difference]: With dead ends: 19211 [2022-04-14 23:29:59,922 INFO L226 Difference]: Without dead ends: 19211 [2022-04-14 23:29:59,922 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:59,923 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 119 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:29:59,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2022-04-14 23:30:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2022-04-14 23:30:00,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:30:00,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:00,088 INFO L74 IsIncluded]: Start isIncluded. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:00,109 INFO L87 Difference]: Start difference. First operand 19211 states. Second operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:08,353 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-14 23:30:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-14 23:30:08,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:08,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:08,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 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 19211 states. [2022-04-14 23:30:08,395 INFO L87 Difference]: Start difference. First operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 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 19211 states. [2022-04-14 23:30:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:16,871 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2022-04-14 23:30:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 26376 transitions. [2022-04-14 23:30:16,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:30:16,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:30:16,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:30:16,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:30:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 2 states have call successors, (2), 2 states have call 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:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2022-04-14 23:30:26,739 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2022-04-14 23:30:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:30:26,739 INFO L478 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2022-04-14 23:30:26,739 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:30:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2022-04-14 23:30:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 23:30:26,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:30:26,746 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:30:26,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 23:30:26,746 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:30:26,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:30:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash -422827415, now seen corresponding path program 1 times [2022-04-14 23:30:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:30:26,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557970644] [2022-04-14 23:30:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:30:26,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:30:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:30:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:30:26,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {441893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {441887#true} is VALID [2022-04-14 23:30:26,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {441887#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441887#true} is VALID [2022-04-14 23:30:26,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441887#true} {441887#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441887#true} is VALID [2022-04-14 23:30:26,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {441887#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:30:26,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {441893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {441887#true} is VALID [2022-04-14 23:30:26,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {441887#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441887#true} {441887#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {441887#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {441887#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {441887#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {441887#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {441887#true} [268] L83-->L83-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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {441887#true} [270] L83-2-->L87-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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {441887#true} [272] L87-1-->L91-1: Formula: (= 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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {441887#true} [274] L91-1-->L95-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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {441887#true} [276] L95-1-->L99-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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {441887#true} [278] L99-1-->L103-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[] {441887#true} is VALID [2022-04-14 23:30:26,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {441887#true} [280] L103-1-->L107-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[] {441887#true} is VALID [2022-04-14 23:30:26,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {441887#true} [282] L107-1-->L111-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[] {441887#true} is VALID [2022-04-14 23:30:26,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {441887#true} [284] L111-1-->L115-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[] {441887#true} is VALID [2022-04-14 23:30:26,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {441887#true} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {441892#(= main_~lk10~0 1)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {441892#(= main_~lk10~0 1)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {441892#(= main_~lk10~0 1)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {441892#(= main_~lk10~0 1)} [294] L131-1-->L137-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {441892#(= main_~lk10~0 1)} [298] L137-1-->L142-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {441892#(= main_~lk10~0 1)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {441892#(= main_~lk10~0 1)} [308] L147-1-->L152-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {441892#(= main_~lk10~0 1)} [312] L152-1-->L157-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {441892#(= main_~lk10~0 1)} [316] L157-1-->L162-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {441892#(= main_~lk10~0 1)} [320] L162-1-->L167-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {441892#(= main_~lk10~0 1)} [324] L167-1-->L172-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {441892#(= main_~lk10~0 1)} [328] L172-1-->L177-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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {441892#(= main_~lk10~0 1)} [331] L177-1-->L183: 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[] {441892#(= main_~lk10~0 1)} is VALID [2022-04-14 23:30:26,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {441892#(= main_~lk10~0 1)} [333] L183-->L198-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[] {441888#false} is VALID [2022-04-14 23:30:26,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {441888#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {441888#false} is VALID [2022-04-14 23:30:26,779 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:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:30:26,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557970644] [2022-04-14 23:30:26,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557970644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:30:26,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:30:26,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:30:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335309037] [2022-04-14 23:30:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:30:26,780 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:30:26,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:30:26,780 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:30:26,797 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:30:26,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:30:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:30:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:30:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:30:26,798 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 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:31:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:31:06,403 INFO L93 Difference]: Finished difference Result 32779 states and 45320 transitions. [2022-04-14 23:31:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:31:06,403 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:31:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:31:06,404 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:31:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:31:06,404 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:31:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:31:06,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-04-14 23:31:06,496 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:31:34,511 INFO L225 Difference]: With dead ends: 32779 [2022-04-14 23:31:34,511 INFO L226 Difference]: Without dead ends: 32779 [2022-04-14 23:31:34,511 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:34,511 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 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:31:34,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 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:31:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2022-04-14 23:31:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 28681. [2022-04-14 23:31:34,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:31:34,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32779 states. Second operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 2 states have call 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:34,853 INFO L74 IsIncluded]: Start isIncluded. First operand 32779 states. Second operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 2 states have call 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:34,884 INFO L87 Difference]: Start difference. First operand 32779 states. Second operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 2 states have call 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:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:32:08,016 INFO L93 Difference]: Finished difference Result 32779 states and 45320 transitions. [2022-04-14 23:32:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32779 states and 45320 transitions. [2022-04-14 23:32:08,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:32:08,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:32:08,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 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 32779 states. [2022-04-14 23:32:08,096 INFO L87 Difference]: Start difference. First operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 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 32779 states. [2022-04-14 23:32:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:32:36,102 INFO L93 Difference]: Finished difference Result 32779 states and 45320 transitions. [2022-04-14 23:32:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 32779 states and 45320 transitions. [2022-04-14 23:32:36,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:32:36,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:32:36,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:32:36,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:32:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28681 states, 28677 states have (on average 1.3302646720368239) internal successors, (38148), 28677 states have internal predecessors, (38148), 2 states have call successors, (2), 2 states have call 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:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28681 states to 28681 states and 38151 transitions. [2022-04-14 23:32:55,151 INFO L78 Accepts]: Start accepts. Automaton has 28681 states and 38151 transitions. Word has length 33 [2022-04-14 23:32:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:32:55,152 INFO L478 AbstractCegarLoop]: Abstraction has 28681 states and 38151 transitions. [2022-04-14 23:32:55,152 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:32:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28681 states and 38151 transitions. [2022-04-14 23:32:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 23:32:55,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:32:55,164 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:32:55,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 23:32:55,164 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:32:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:32:55,165 INFO L85 PathProgramCache]: Analyzing trace with hash -933361592, now seen corresponding path program 1 times [2022-04-14 23:32:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:32:55,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848894360] [2022-04-14 23:32:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:32:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:32:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:32:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:32:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:32:55,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {568923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {568917#true} is VALID [2022-04-14 23:32:55,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {568917#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568917#true} is VALID [2022-04-14 23:32:55,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {568917#true} {568917#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {568917#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {568923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {568917#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {568917#true} {568917#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {568917#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {568917#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {568917#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {568917#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {568917#true} [268] L83-->L83-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[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {568917#true} [270] L83-2-->L87-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[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {568917#true} [272] L87-1-->L91-1: Formula: (= 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[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {568917#true} [274] L91-1-->L95-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[] {568917#true} is VALID [2022-04-14 23:32:55,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {568917#true} [276] L95-1-->L99-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[] {568917#true} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {568917#true} [278] L99-1-->L103-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[] {568917#true} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {568917#true} [280] L103-1-->L107-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[] {568917#true} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {568917#true} [282] L107-1-->L111-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[] {568917#true} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {568917#true} [284] L111-1-->L115-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[] {568917#true} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {568917#true} [286] L115-1-->L119-1: Formula: (= v_main_~p10~0_4 0) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {568922#(= main_~p10~0 0)} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {568922#(= main_~p10~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {568922#(= main_~p10~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {568922#(= main_~p10~0 0)} [294] L131-1-->L137-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {568922#(= main_~p10~0 0)} [298] L137-1-->L142-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {568922#(= main_~p10~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {568922#(= main_~p10~0 0)} [308] L147-1-->L152-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {568922#(= main_~p10~0 0)} [312] L152-1-->L157-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {568922#(= main_~p10~0 0)} [316] L157-1-->L162-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {568922#(= main_~p10~0 0)} [320] L162-1-->L167-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {568922#(= main_~p10~0 0)} [324] L167-1-->L172-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {568922#(= main_~p10~0 0)} [328] L172-1-->L177-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[] {568922#(= main_~p10~0 0)} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {568922#(= main_~p10~0 0)} [331] L177-1-->L183: 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[] {568918#false} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {568918#false} [333] L183-->L198-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[] {568918#false} is VALID [2022-04-14 23:32:55,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {568918#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568918#false} is VALID [2022-04-14 23:32:55,198 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:32:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:32:55,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848894360] [2022-04-14 23:32:55,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848894360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:32:55,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:32:55,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:32:55,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542466851] [2022-04-14 23:32:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:32:55,198 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:32:55,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:32:55,199 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:32:55,214 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:32:55,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:32:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:32:55,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:32:55,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:32:55,215 INFO L87 Difference]: Start difference. First operand 28681 states and 38151 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:33:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:33:32,344 INFO L93 Difference]: Finished difference Result 37387 states and 49160 transitions. [2022-04-14 23:33:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:33:32,345 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:33:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:33:32,345 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:33:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-14 23:33:32,346 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:33:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-14 23:33:32,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-14 23:33:32,431 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:34:06,286 INFO L225 Difference]: With dead ends: 37387 [2022-04-14 23:34:06,287 INFO L226 Difference]: Without dead ends: 37387 [2022-04-14 23:34:06,287 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:34:06,287 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:34:06,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 137 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:34:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37387 states. [2022-04-14 23:34:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37387 to 37385. [2022-04-14 23:34:06,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:34:06,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:06,691 INFO L74 IsIncluded]: Start isIncluded. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:06,722 INFO L87 Difference]: Start difference. First operand 37387 states. Second operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:34:44,544 INFO L93 Difference]: Finished difference Result 37387 states and 49160 transitions. [2022-04-14 23:34:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 49160 transitions. [2022-04-14 23:34:44,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:34:44,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:34:44,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 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 37387 states. [2022-04-14 23:34:44,645 INFO L87 Difference]: Start difference. First operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 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 37387 states. [2022-04-14 23:35:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:35:16,527 INFO L93 Difference]: Finished difference Result 37387 states and 49160 transitions. [2022-04-14 23:35:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37387 states and 49160 transitions. [2022-04-14 23:35:16,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:35:16,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:35:16,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:35:16,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:35:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 49159 transitions. [2022-04-14 23:37:03,729 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 49159 transitions. Word has length 33 [2022-04-14 23:37:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:37:03,730 INFO L478 AbstractCegarLoop]: Abstraction has 37385 states and 49159 transitions. [2022-04-14 23:37:03,730 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:37:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 49159 transitions. [2022-04-14 23:37:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 23:37:03,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:37:03,750 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, 1] [2022-04-14 23:37:03,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-14 23:37:03,750 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:37:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:37:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -222714787, now seen corresponding path program 1 times [2022-04-14 23:37:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:37:03,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106105634] [2022-04-14 23:37:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:37:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:37:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:37:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:37:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:37:03,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {718481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {718475#true} is VALID [2022-04-14 23:37:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {718475#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718475#true} is VALID [2022-04-14 23:37:03,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {718475#true} {718475#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {718475#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {718481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {718475#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718475#true} {718475#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {718475#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {718475#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {718475#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {718475#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {718475#true} [268] L83-->L83-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[] {718475#true} is VALID [2022-04-14 23:37:03,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {718475#true} [270] L83-2-->L87-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {718475#true} [272] L87-1-->L91-1: Formula: (= 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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {718475#true} [274] L91-1-->L95-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {718475#true} [276] L95-1-->L99-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {718475#true} [278] L99-1-->L103-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {718475#true} [280] L103-1-->L107-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {718475#true} [282] L107-1-->L111-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {718475#true} [284] L111-1-->L115-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[] {718475#true} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {718475#true} [285] L115-1-->L119-1: Formula: (and (= v_main_~lk10~0_4 1) (not (= v_main_~p10~0_3 0))) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~lk10~0=v_main_~lk10~0_4, main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[main_~lk10~0] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {718480#(not (= main_~p10~0 0))} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {718480#(not (= main_~p10~0 0))} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {718480#(not (= main_~p10~0 0))} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {718480#(not (= main_~p10~0 0))} [294] L131-1-->L137-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {718480#(not (= main_~p10~0 0))} [298] L137-1-->L142-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {718480#(not (= main_~p10~0 0))} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {718480#(not (= main_~p10~0 0))} [308] L147-1-->L152-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {718480#(not (= main_~p10~0 0))} [312] L152-1-->L157-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {718480#(not (= main_~p10~0 0))} [316] L157-1-->L162-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {718480#(not (= main_~p10~0 0))} [320] L162-1-->L167-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {718480#(not (= main_~p10~0 0))} [324] L167-1-->L172-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {718480#(not (= main_~p10~0 0))} [328] L172-1-->L177-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[] {718480#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:37:03,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {718480#(not (= main_~p10~0 0))} [332] L177-1-->L182-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[] {718476#false} is VALID [2022-04-14 23:37:03,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {718476#false} [335] L182-1-->L188: Formula: (not (= v_main_~p11~0_3 0)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[] {718476#false} is VALID [2022-04-14 23:37:03,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {718476#false} [337] L188-->L198-1: Formula: (not (= v_main_~lk11~0_4 1)) InVars {main_~lk11~0=v_main_~lk11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_4} AuxVars[] AssignedVars[] {718476#false} is VALID [2022-04-14 23:37:03,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {718476#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718476#false} is VALID [2022-04-14 23:37:03,789 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:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:37:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106105634] [2022-04-14 23:37:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106105634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:37:03,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:37:03,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:37:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732292272] [2022-04-14 23:37:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:37:03,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-14 23:37:03,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:37:03,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:03,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:37:03,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:37:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:37:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:37:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:37:03,810 INFO L87 Difference]: Start difference. First operand 37385 states and 49159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:37:38,104 INFO L93 Difference]: Finished difference Result 37899 states and 49160 transitions. [2022-04-14 23:37:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:37:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-14 23:37:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:37:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:37:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-04-14 23:37:38,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-04-14 23:37:38,192 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:38:12,894 INFO L225 Difference]: With dead ends: 37899 [2022-04-14 23:38:12,894 INFO L226 Difference]: Without dead ends: 37899 [2022-04-14 23:38:12,894 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:12,898 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 116 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:38:12,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 116 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:38:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37899 states. [2022-04-14 23:38:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37899 to 37897. [2022-04-14 23:38:13,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:38:13,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37899 states. Second operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:13,261 INFO L74 IsIncluded]: Start isIncluded. First operand 37899 states. Second operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:13,292 INFO L87 Difference]: Start difference. First operand 37899 states. Second operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:38:46,169 INFO L93 Difference]: Finished difference Result 37899 states and 49160 transitions. [2022-04-14 23:38:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 37899 states and 49160 transitions. [2022-04-14 23:38:46,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:38:46,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:38:46,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 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 37899 states. [2022-04-14 23:38:46,266 INFO L87 Difference]: Start difference. First operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 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 37899 states. [2022-04-14 23:39:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:39:21,789 INFO L93 Difference]: Finished difference Result 37899 states and 49160 transitions. [2022-04-14 23:39:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37899 states and 49160 transitions. [2022-04-14 23:39:21,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:39:21,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:39:21,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:39:21,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:39:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37897 states, 37893 states have (on average 1.2972316786741616) internal successors, (49156), 37893 states have internal predecessors, (49156), 2 states have call successors, (2), 2 states have call 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:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37897 states to 37897 states and 49159 transitions. [2022-04-14 23:39:55,927 INFO L78 Accepts]: Start accepts. Automaton has 37897 states and 49159 transitions. Word has length 34 [2022-04-14 23:39:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:39:55,935 INFO L478 AbstractCegarLoop]: Abstraction has 37897 states and 49159 transitions. [2022-04-14 23:39:55,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 37897 states and 49159 transitions. [2022-04-14 23:39:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 23:39:55,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:39:55,949 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, 1] [2022-04-14 23:39:55,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-14 23:39:55,949 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:39:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:39:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1130594910, now seen corresponding path program 1 times [2022-04-14 23:39:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:39:55,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552088529] [2022-04-14 23:39:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:39:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:39:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:39:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:39:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:39:55,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {870087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {870081#true} is VALID [2022-04-14 23:39:55,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {870081#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {870081#true} {870081#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {870081#true} [254] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {870087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [256] 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] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {870081#true} [259] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870081#true} {870081#true} [347] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {870081#true} [255] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {870081#true} [258] mainENTRY-->L197-1: Formula: (and (= v_main_~p4~0_1 |v_main_#t~nondet7_2|) (<= |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|) (<= 0 (+ |v_main_#t~nondet16_2| 2147483648)) (<= |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)) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (= v_main_~p3~0_2 |v_main_#t~nondet6_2|) (<= |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|) (<= |v_main_#t~nondet16_2| 2147483647) (<= 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~nondet16_2| v_main_~p13~0_1) (= |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)) 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~nondet16=|v_main_#t~nondet16_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_~p13~0=v_main_~p13~0_1, 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_3, 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_1, main_~lk7~0=v_main_~lk7~0_1, main_~p12~0=v_main_~p12~0_1, main_~lk13~0=v_main_~lk13~0_1, main_~lk4~0=v_main_~lk4~0_1, main_~p3~0=v_main_~p3~0_2, main_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~p13~0, 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~nondet16, main_#t~nondet15, main_~p12~0, main_#t~nondet14, main_#t~nondet13, main_~lk13~0, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {870081#true} [262] L197-1-->L52: Formula: (and (<= |v_main_#t~nondet17_2| 2147483647) (= |v_main_#t~nondet17_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet17_2| 2147483648))) InVars {main_#t~nondet17=|v_main_#t~nondet17_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet17, main_~cond~0] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {870081#true} [265] L52-->L83: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk7~0_2 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_~lk13~0_2 0) (= v_main_~lk4~0_5 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk3~0_4 0) (= v_main_~lk5~0_2 0) (= 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_4, 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_2, 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_~lk13~0=v_main_~lk13~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_~lk3~0, main_~lk1~0, main_~lk12~0, main_~lk10~0, main_~lk5~0, main_~lk9~0, main_~lk7~0, main_~lk2~0, main_~lk11~0, main_~lk13~0, main_~lk4~0, main_~lk6~0, main_~lk8~0] {870081#true} is VALID [2022-04-14 23:39:55,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {870081#true} [268] L83-->L83-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {870081#true} [270] L83-2-->L87-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {870081#true} [272] L87-1-->L91-1: Formula: (= 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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {870081#true} [274] L91-1-->L95-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {870081#true} [276] L95-1-->L99-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {870081#true} [278] L99-1-->L103-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {870081#true} [280] L103-1-->L107-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {870081#true} [282] L107-1-->L111-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {870081#true} [284] L111-1-->L115-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[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {870081#true} [286] L115-1-->L119-1: Formula: (= v_main_~p10~0_4 0) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[] {870081#true} is VALID [2022-04-14 23:39:55,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {870081#true} [288] L119-1-->L123-1: Formula: (= v_main_~p11~0_4 0) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {870086#(= main_~p11~0 0)} [289] L123-1-->L127-1: Formula: (and (= v_main_~lk12~0_3 1) (not (= v_main_~p12~0_2 0))) InVars {main_~p12~0=v_main_~p12~0_2} OutVars{main_~p12~0=v_main_~p12~0_2, main_~lk12~0=v_main_~lk12~0_3} AuxVars[] AssignedVars[main_~lk12~0] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {870086#(= main_~p11~0 0)} [291] L127-1-->L131-1: Formula: (and (= v_main_~lk13~0_3 1) (not (= v_main_~p13~0_2 0))) InVars {main_~p13~0=v_main_~p13~0_2} OutVars{main_~p13~0=v_main_~p13~0_2, main_~lk13~0=v_main_~lk13~0_3} AuxVars[] AssignedVars[main_~lk13~0] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {870086#(= main_~p11~0 0)} [294] L131-1-->L137-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {870086#(= main_~p11~0 0)} [298] L137-1-->L142-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {870086#(= main_~p11~0 0)} [304] L142-1-->L147-1: Formula: (= v_main_~p3~0_1 0) InVars {main_~p3~0=v_main_~p3~0_1} OutVars{main_~p3~0=v_main_~p3~0_1} AuxVars[] AssignedVars[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {870086#(= main_~p11~0 0)} [308] L147-1-->L152-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {870086#(= main_~p11~0 0)} [312] L152-1-->L157-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {870086#(= main_~p11~0 0)} [316] L157-1-->L162-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {870086#(= main_~p11~0 0)} [320] L162-1-->L167-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {870086#(= main_~p11~0 0)} [324] L167-1-->L172-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {870086#(= main_~p11~0 0)} [328] L172-1-->L177-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {870086#(= main_~p11~0 0)} [332] L177-1-->L182-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[] {870086#(= main_~p11~0 0)} is VALID [2022-04-14 23:39:55,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {870086#(= main_~p11~0 0)} [335] L182-1-->L188: Formula: (not (= v_main_~p11~0_3 0)) InVars {main_~p11~0=v_main_~p11~0_3} OutVars{main_~p11~0=v_main_~p11~0_3} AuxVars[] AssignedVars[] {870082#false} is VALID [2022-04-14 23:39:55,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {870082#false} [337] L188-->L198-1: Formula: (not (= v_main_~lk11~0_4 1)) InVars {main_~lk11~0=v_main_~lk11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_4} AuxVars[] AssignedVars[] {870082#false} is VALID [2022-04-14 23:39:55,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {870082#false} [299] L198-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870082#false} is VALID [2022-04-14 23:39:55,999 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:39:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:39:55,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552088529] [2022-04-14 23:39:55,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552088529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:39:55,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:39:56,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:39:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698126210] [2022-04-14 23:39:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:39:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-14 23:39:56,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:39:56,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call 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:56,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:39:56,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:39:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:39:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:39:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:39:56,021 INFO L87 Difference]: Start difference. First operand 37897 states and 49159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)