/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 23:27:10,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 23:27:10,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 23:27:10,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 23:27:10,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 23:27:10,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 23:27:10,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 23:27:10,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 23:27:10,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 23:27:10,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 23:27:10,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 23:27:10,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 23:27:10,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 23:27:10,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 23:27:10,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 23:27:10,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 23:27:10,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 23:27:10,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 23:27:10,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 23:27:10,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 23:27:10,708 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 23:27:10,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 23:27:10,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 23:27:10,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 23:27:10,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 23:27:10,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 23:27:10,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 23:27:10,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 23:27:10,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 23:27:10,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 23:27:10,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 23:27:10,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 23:27:10,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 23:27:10,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 23:27:10,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 23:27:10,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 23:27:10,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 23:27:10,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 23:27:10,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 23:27:10,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 23:27:10,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 23:27:10,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 23:27:10,727 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:10,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 23:27:10,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 23:27:10,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 23:27:10,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 23:27:10,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 23:27:10,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 23:27:10,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 23:27:10,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 23:27:10,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 23:27:10,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 23:27:10,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 23:27:10,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 23:27:10,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:10,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 23:27:10,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 23:27:10,744 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 23:27:10,744 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:10,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 23:27:11,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 23:27:11,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 23:27:11,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 23:27:11,004 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 23:27:11,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-14 23:27:11,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bad295e4/413bd240a04f420e8d931de64d374c20/FLAG0345f7b65 [2022-04-14 23:27:11,469 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 23:27:11,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-14 23:27:11,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bad295e4/413bd240a04f420e8d931de64d374c20/FLAG0345f7b65 [2022-04-14 23:27:11,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bad295e4/413bd240a04f420e8d931de64d374c20 [2022-04-14 23:27:11,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 23:27:11,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 23:27:11,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:11,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 23:27:11,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 23:27:11,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:11" (1/1) ... [2022-04-14 23:27:11,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8587fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:11, skipping insertion in model container [2022-04-14 23:27:11,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:27:11" (1/1) ... [2022-04-14 23:27:11,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 23:27:11,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 23:27:12,050 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_11.c[4246,4259] [2022-04-14 23:27:12,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:12,061 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 23:27:12,087 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_11.c[4246,4259] [2022-04-14 23:27:12,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 23:27:12,100 INFO L208 MainTranslator]: Completed translation [2022-04-14 23:27:12,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:12 WrapperNode [2022-04-14 23:27:12,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 23:27:12,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 23:27:12,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 23:27:12,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 23:27:12,109 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:12" (1/1) ... [2022-04-14 23:27:12,109 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:12" (1/1) ... [2022-04-14 23:27:12,115 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:12" (1/1) ... [2022-04-14 23:27:12,115 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:12" (1/1) ... [2022-04-14 23:27:12,123 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:12" (1/1) ... [2022-04-14 23:27:12,134 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:12" (1/1) ... [2022-04-14 23:27:12,135 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:12" (1/1) ... [2022-04-14 23:27:12,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 23:27:12,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 23:27:12,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 23:27:12,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 23:27:12,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:12" (1/1) ... [2022-04-14 23:27:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 23:27:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 23:27:12,171 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:12,172 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:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 23:27:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 23:27:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 23:27:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 23:27:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 23:27:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 23:27:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 23:27:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 23:27:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 23:27:12,260 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 23:27:12,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 23:27:12,556 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 23:27:12,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 23:27:12,562 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 23:27:12,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:12 BoogieIcfgContainer [2022-04-14 23:27:12,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 23:27:12,564 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 23:27:12,564 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 23:27:12,567 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 23:27:12,570 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:12" (1/1) ... [2022-04-14 23:27:12,572 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 23:27:12,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:12 BasicIcfg [2022-04-14 23:27:12,632 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 23:27:12,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 23:27:12,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 23:27:12,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 23:27:12,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:27:11" (1/4) ... [2022-04-14 23:27:12,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5842d2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:12, skipping insertion in model container [2022-04-14 23:27:12,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:27:12" (2/4) ... [2022-04-14 23:27:12,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5842d2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:27:12, skipping insertion in model container [2022-04-14 23:27:12,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:27:12" (3/4) ... [2022-04-14 23:27:12,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5842d2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:27:12, skipping insertion in model container [2022-04-14 23:27:12,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:27:12" (4/4) ... [2022-04-14 23:27:12,646 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.cJordan [2022-04-14 23:27:12,651 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 23:27:12,652 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 23:27:12,696 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 23:27:12,708 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:12,708 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 23:27:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:27:12,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:12,744 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] [2022-04-14 23:27:12,745 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1766201146, now seen corresponding path program 1 times [2022-04-14 23:27:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:12,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85333089] [2022-04-14 23:27:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:13,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {51#true} is VALID [2022-04-14 23:27:13,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-14 23:27:13,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-14 23:27:13,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:13,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {51#true} is VALID [2022-04-14 23:27:13,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-14 23:27:13,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-14 23:27:13,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-14 23:27:13,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {51#true} is VALID [2022-04-14 23:27:13,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {51#true} is VALID [2022-04-14 23:27:13,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {51#true} is VALID [2022-04-14 23:27:13,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} [233] L73-->L73-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} [235] L73-2-->L77-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} [241] L85-1-->L89-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} [243] L89-1-->L93-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} [245] L93-1-->L97-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} [247] L97-1-->L101-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} [249] L101-1-->L105-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] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} [255] L113-1-->L120: 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[] {56#(= main_~lk1~0 1)} is VALID [2022-04-14 23:27:13,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} [257] L120-->L170-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[] {52#false} is VALID [2022-04-14 23:27:13,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-14 23:27:13,079 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:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85333089] [2022-04-14 23:27:13,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85333089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:13,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:13,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702446793] [2022-04-14 23:27:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-14 23:27:13,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:13,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:13,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:13,154 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 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 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:13,558 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-04-14 23:27:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-14 23:27:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-14 23:27:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2022-04-14 23:27:13,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2022-04-14 23:27:13,738 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:13,751 INFO L225 Difference]: With dead ends: 87 [2022-04-14 23:27:13,751 INFO L226 Difference]: Without dead ends: 79 [2022-04-14 23:27:13,753 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:13,757 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:13,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-14 23:27:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-14 23:27:13,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:13,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,795 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,798 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:13,809 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-14 23:27:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-14 23:27:13,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:13,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:13,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-14 23:27:13,812 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-14 23:27:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:13,820 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-14 23:27:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-14 23:27:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:13,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:13,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:13,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-14 23:27:13,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-14 23:27:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:13,836 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-14 23:27:13,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-14 23:27:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 23:27:13,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:13,837 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] [2022-04-14 23:27:13,837 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 23:27:13,838 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2023207525, now seen corresponding path program 1 times [2022-04-14 23:27:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150641068] [2022-04-14 23:27:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:13,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {363#true} is VALID [2022-04-14 23:27:13,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-14 23:27:13,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-14 23:27:13,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:13,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {363#true} is VALID [2022-04-14 23:27:13,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-14 23:27:13,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-14 23:27:13,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-14 23:27:13,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {363#true} is VALID [2022-04-14 23:27:13,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {363#true} is VALID [2022-04-14 23:27:13,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {363#true} is VALID [2022-04-14 23:27:13,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} [234] L73-->L73-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[] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= main_~p1~0 0)} [235] L73-2-->L77-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(= main_~p1~0 0)} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(= main_~p1~0 0)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(= main_~p1~0 0)} [241] L85-1-->L89-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#(= main_~p1~0 0)} [243] L89-1-->L93-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#(= main_~p1~0 0)} [245] L93-1-->L97-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#(= main_~p1~0 0)} [247] L97-1-->L101-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#(= main_~p1~0 0)} [249] L101-1-->L105-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] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#(= main_~p1~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#(= main_~p1~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {368#(= main_~p1~0 0)} is VALID [2022-04-14 23:27:13,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {368#(= main_~p1~0 0)} [255] L113-1-->L120: 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[] {364#false} is VALID [2022-04-14 23:27:13,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} [257] L120-->L170-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[] {364#false} is VALID [2022-04-14 23:27:13,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-14 23:27:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:27:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:13,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150641068] [2022-04-14 23:27:13,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150641068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:13,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528693336] [2022-04-14 23:27:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:13,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-14 23:27:13,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:13,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:13,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:13,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:13,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:13,967 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,210 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-14 23:27:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 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 22 [2022-04-14 23:27:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-14 23:27:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-14 23:27:14,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-14 23:27:14,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:14,350 INFO L225 Difference]: With dead ends: 79 [2022-04-14 23:27:14,350 INFO L226 Difference]: Without dead ends: 79 [2022-04-14 23:27:14,354 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:14,357 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:14,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-14 23:27:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-14 23:27:14,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:14,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,367 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,367 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,370 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-14 23:27:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-14 23:27:14,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:14,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:14,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-14 23:27:14,372 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-14 23:27:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,376 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-14 23:27:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-14 23:27:14,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:14,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:14,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:14,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-14 23:27:14,389 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-14 23:27:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:14,389 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-14 23:27:14,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-14 23:27:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:27:14,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:14,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:14,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 23:27:14,392 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1082371358, now seen corresponding path program 1 times [2022-04-14 23:27:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:14,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915552947] [2022-04-14 23:27:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:14,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {689#true} is VALID [2022-04-14 23:27:14,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-14 23:27:14,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-14 23:27:14,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:14,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {689#true} is VALID [2022-04-14 23:27:14,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-14 23:27:14,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-14 23:27:14,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-14 23:27:14,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {689#true} is VALID [2022-04-14 23:27:14,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {689#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {689#true} is VALID [2022-04-14 23:27:14,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {689#true} is VALID [2022-04-14 23:27:14,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} [233] L73-->L73-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {694#(not (= main_~p1~0 0))} [235] L73-2-->L77-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(not (= main_~p1~0 0))} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(not (= main_~p1~0 0))} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#(not (= main_~p1~0 0))} [241] L85-1-->L89-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {694#(not (= main_~p1~0 0))} [243] L89-1-->L93-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#(not (= main_~p1~0 0))} [245] L93-1-->L97-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#(not (= main_~p1~0 0))} [247] L97-1-->L101-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#(not (= main_~p1~0 0))} [249] L101-1-->L105-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] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {694#(not (= main_~p1~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {694#(not (= main_~p1~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {694#(not (= main_~p1~0 0))} is VALID [2022-04-14 23:27:14,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {694#(not (= main_~p1~0 0))} [256] L113-1-->L119-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[] {690#false} is VALID [2022-04-14 23:27:14,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {690#false} [259] L119-1-->L125: 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[] {690#false} is VALID [2022-04-14 23:27:14,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {690#false} [263] L125-->L170-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[] {690#false} is VALID [2022-04-14 23:27:14,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {690#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-14 23:27:14,463 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:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:14,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915552947] [2022-04-14 23:27:14,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915552947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:14,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:14,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558622489] [2022-04-14 23:27:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:14,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:14,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:14,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:14,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:14,483 INFO L87 Difference]: Start difference. First operand 77 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,703 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-14 23:27:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:14,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-14 23:27:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-14 23:27:14,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 140 transitions. [2022-04-14 23:27:14,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:14,846 INFO L225 Difference]: With dead ends: 82 [2022-04-14 23:27:14,847 INFO L226 Difference]: Without dead ends: 82 [2022-04-14 23:27:14,849 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:14,854 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:14,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-14 23:27:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-14 23:27:14,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:14,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,866 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,867 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,870 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-14 23:27:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-14 23:27:14,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:14,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:14,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-14 23:27:14,871 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-14 23:27:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:14,874 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-14 23:27:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-14 23:27:14,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:14,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:14,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:14,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-14 23:27:14,884 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-14 23:27:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:14,884 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-14 23:27:14,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-14 23:27:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:27:14,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:14,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:14,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 23:27:14,886 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1705044129, now seen corresponding path program 1 times [2022-04-14 23:27:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:14,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687367549] [2022-04-14 23:27:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:14,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {1027#true} is VALID [2022-04-14 23:27:14,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-14 23:27:14,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1027#true} {1027#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-14 23:27:14,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:14,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {1027#true} is VALID [2022-04-14 23:27:14,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-14 23:27:14,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-14 23:27:14,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-14 23:27:14,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1027#true} is VALID [2022-04-14 23:27:14,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1027#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {1027#true} is VALID [2022-04-14 23:27:14,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1027#true} is VALID [2022-04-14 23:27:14,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} [234] L73-->L73-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[] {1027#true} is VALID [2022-04-14 23:27:14,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} [235] L73-2-->L77-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {1032#(= main_~lk2~0 1)} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {1032#(= main_~lk2~0 1)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(= main_~lk2~0 1)} [241] L85-1-->L89-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(= main_~lk2~0 1)} [243] L89-1-->L93-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(= main_~lk2~0 1)} [245] L93-1-->L97-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {1032#(= main_~lk2~0 1)} [247] L97-1-->L101-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(= main_~lk2~0 1)} [249] L101-1-->L105-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] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(= main_~lk2~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {1032#(= main_~lk2~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {1032#(= main_~lk2~0 1)} [256] L113-1-->L119-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[] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {1032#(= main_~lk2~0 1)} [259] L119-1-->L125: 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[] {1032#(= main_~lk2~0 1)} is VALID [2022-04-14 23:27:14,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {1032#(= main_~lk2~0 1)} [263] L125-->L170-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[] {1028#false} is VALID [2022-04-14 23:27:14,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {1028#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-14 23:27:15,000 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:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:15,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687367549] [2022-04-14 23:27:15,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687367549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:15,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:15,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510664134] [2022-04-14 23:27:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:15,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:15,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:15,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:15,019 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,244 INFO L93 Difference]: Finished difference Result 147 states and 262 transitions. [2022-04-14 23:27:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:15,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-14 23:27:15,381 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:15,384 INFO L225 Difference]: With dead ends: 147 [2022-04-14 23:27:15,384 INFO L226 Difference]: Without dead ends: 147 [2022-04-14 23:27:15,384 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:15,385 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:15,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-14 23:27:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2022-04-14 23:27:15,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:15,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,402 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,402 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,407 INFO L93 Difference]: Finished difference Result 147 states and 262 transitions. [2022-04-14 23:27:15,407 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 262 transitions. [2022-04-14 23:27:15,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:15,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:15,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 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 147 states. [2022-04-14 23:27:15,408 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 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 147 states. [2022-04-14 23:27:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,412 INFO L93 Difference]: Finished difference Result 147 states and 262 transitions. [2022-04-14 23:27:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 262 transitions. [2022-04-14 23:27:15,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:15,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:15,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:15,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2022-04-14 23:27:15,417 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 23 [2022-04-14 23:27:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:15,417 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2022-04-14 23:27:15,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2022-04-14 23:27:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 23:27:15,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:15,418 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 23:27:15,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 23:27:15,418 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2084364542, now seen corresponding path program 1 times [2022-04-14 23:27:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:15,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20724175] [2022-04-14 23:27:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:15,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {1585#true} is VALID [2022-04-14 23:27:15,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#true} is VALID [2022-04-14 23:27:15,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1585#true} {1585#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#true} is VALID [2022-04-14 23:27:15,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:15,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {1585#true} is VALID [2022-04-14 23:27:15,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1585#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#true} is VALID [2022-04-14 23:27:15,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#true} is VALID [2022-04-14 23:27:15,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1585#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1585#true} is VALID [2022-04-14 23:27:15,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1585#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {1585#true} is VALID [2022-04-14 23:27:15,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {1585#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {1585#true} is VALID [2022-04-14 23:27:15,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1585#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {1585#true} is VALID [2022-04-14 23:27:15,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1585#true} [234] L73-->L73-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[] {1585#true} is VALID [2022-04-14 23:27:15,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} [236] L73-2-->L77-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[] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {1590#(= main_~p2~0 0)} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1590#(= main_~p2~0 0)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1590#(= main_~p2~0 0)} [241] L85-1-->L89-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] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {1590#(= main_~p2~0 0)} [243] L89-1-->L93-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] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1590#(= main_~p2~0 0)} [245] L93-1-->L97-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] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {1590#(= main_~p2~0 0)} [247] L97-1-->L101-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] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {1590#(= main_~p2~0 0)} [249] L101-1-->L105-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] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {1590#(= main_~p2~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {1590#(= main_~p2~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {1590#(= main_~p2~0 0)} [256] L113-1-->L119-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[] {1590#(= main_~p2~0 0)} is VALID [2022-04-14 23:27:15,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {1590#(= main_~p2~0 0)} [259] L119-1-->L125: 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[] {1586#false} is VALID [2022-04-14 23:27:15,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {1586#false} [263] L125-->L170-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[] {1586#false} is VALID [2022-04-14 23:27:15,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {1586#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1586#false} is VALID [2022-04-14 23:27:15,498 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:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:15,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20724175] [2022-04-14 23:27:15,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20724175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:15,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:15,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546621795] [2022-04-14 23:27:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:15,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:15,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:15,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:15,517 INFO L87 Difference]: Start difference. First operand 105 states and 185 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,694 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2022-04-14 23:27:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 23:27:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-14 23:27:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-14 23:27:15,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-14 23:27:15,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:15,819 INFO L225 Difference]: With dead ends: 149 [2022-04-14 23:27:15,819 INFO L226 Difference]: Without dead ends: 149 [2022-04-14 23:27:15,820 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:15,820 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:15,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 105 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-14 23:27:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-14 23:27:15,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:15,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,826 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,826 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,831 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2022-04-14 23:27:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 260 transitions. [2022-04-14 23:27:15,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:15,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:15,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 149 states. [2022-04-14 23:27:15,832 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 149 states. [2022-04-14 23:27:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:15,836 INFO L93 Difference]: Finished difference Result 149 states and 260 transitions. [2022-04-14 23:27:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 260 transitions. [2022-04-14 23:27:15,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:15,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:15,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:15,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-14 23:27:15,841 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-14 23:27:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:15,841 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-14 23:27:15,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-14 23:27:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:15,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:15,842 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:15,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 23:27:15,842 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1316728287, now seen corresponding path program 1 times [2022-04-14 23:27:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:15,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091755114] [2022-04-14 23:27:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:15,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {2191#true} is VALID [2022-04-14 23:27:15,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2191#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2191#true} is VALID [2022-04-14 23:27:15,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2191#true} {2191#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2191#true} is VALID [2022-04-14 23:27:15,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {2191#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:15,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {2191#true} is VALID [2022-04-14 23:27:15,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2191#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2191#true} {2191#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {2191#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {2191#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {2191#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {2191#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2191#true} is VALID [2022-04-14 23:27:15,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {2191#true} [234] L73-->L73-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[] {2191#true} is VALID [2022-04-14 23:27:15,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {2191#true} [235] L73-2-->L77-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {2196#(not (= main_~p2~0 0))} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {2196#(not (= main_~p2~0 0))} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {2196#(not (= main_~p2~0 0))} [241] L85-1-->L89-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {2196#(not (= main_~p2~0 0))} [243] L89-1-->L93-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {2196#(not (= main_~p2~0 0))} [245] L93-1-->L97-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2196#(not (= main_~p2~0 0))} [247] L97-1-->L101-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2196#(not (= main_~p2~0 0))} [249] L101-1-->L105-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] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {2196#(not (= main_~p2~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(not (= main_~p2~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {2196#(not (= main_~p2~0 0))} [256] L113-1-->L119-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[] {2196#(not (= main_~p2~0 0))} is VALID [2022-04-14 23:27:15,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {2196#(not (= main_~p2~0 0))} [260] L119-1-->L124-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[] {2192#false} is VALID [2022-04-14 23:27:15,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#false} [265] L124-1-->L130: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2192#false} is VALID [2022-04-14 23:27:15,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#false} [267] L130-->L170-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2192#false} is VALID [2022-04-14 23:27:15,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {2192#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2192#false} is VALID [2022-04-14 23:27:15,895 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:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:15,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091755114] [2022-04-14 23:27:15,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091755114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:15,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:15,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640580098] [2022-04-14 23:27:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:15,896 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:15,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:15,897 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:15,912 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:15,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:15,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:15,913 INFO L87 Difference]: Start difference. First operand 147 states and 259 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:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,113 INFO L93 Difference]: Finished difference Result 151 states and 260 transitions. [2022-04-14 23:27:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:16,114 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:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:16,114 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:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:16,115 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:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-14 23:27:16,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-14 23:27:16,232 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:16,234 INFO L225 Difference]: With dead ends: 151 [2022-04-14 23:27:16,234 INFO L226 Difference]: Without dead ends: 151 [2022-04-14 23:27:16,234 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:16,235 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:16,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 120 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-14 23:27:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-04-14 23:27:16,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:16,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,240 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,240 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,248 INFO L93 Difference]: Finished difference Result 151 states and 260 transitions. [2022-04-14 23:27:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 260 transitions. [2022-04-14 23:27:16,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:16,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:16,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 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 151 states. [2022-04-14 23:27:16,250 INFO L87 Difference]: Start difference. First operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 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 151 states. [2022-04-14 23:27:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,254 INFO L93 Difference]: Finished difference Result 151 states and 260 transitions. [2022-04-14 23:27:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 260 transitions. [2022-04-14 23:27:16,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:16,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:16,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:16,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 259 transitions. [2022-04-14 23:27:16,260 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 259 transitions. Word has length 24 [2022-04-14 23:27:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:16,260 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 259 transitions. [2022-04-14 23:27:16,260 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:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 259 transitions. [2022-04-14 23:27:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:16,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:16,260 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:16,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 23:27:16,261 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 190823522, now seen corresponding path program 1 times [2022-04-14 23:27:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:16,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956126109] [2022-04-14 23:27:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:16,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {2811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {2805#true} is VALID [2022-04-14 23:27:16,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2805#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#true} is VALID [2022-04-14 23:27:16,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2805#true} {2805#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#true} is VALID [2022-04-14 23:27:16,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {2805#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:16,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {2805#true} is VALID [2022-04-14 23:27:16,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {2805#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#true} is VALID [2022-04-14 23:27:16,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2805#true} {2805#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#true} is VALID [2022-04-14 23:27:16,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {2805#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2805#true} is VALID [2022-04-14 23:27:16,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {2805#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {2805#true} is VALID [2022-04-14 23:27:16,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {2805#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {2805#true} is VALID [2022-04-14 23:27:16,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {2805#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {2805#true} is VALID [2022-04-14 23:27:16,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2805#true} [234] L73-->L73-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[] {2805#true} is VALID [2022-04-14 23:27:16,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2805#true} [236] L73-2-->L77-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[] {2805#true} is VALID [2022-04-14 23:27:16,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {2805#true} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2810#(= main_~lk3~0 1)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2810#(= main_~lk3~0 1)} [241] L85-1-->L89-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] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2810#(= main_~lk3~0 1)} [243] L89-1-->L93-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] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2810#(= main_~lk3~0 1)} [245] L93-1-->L97-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] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {2810#(= main_~lk3~0 1)} [247] L97-1-->L101-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] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {2810#(= main_~lk3~0 1)} [249] L101-1-->L105-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] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {2810#(= main_~lk3~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {2810#(= main_~lk3~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {2810#(= main_~lk3~0 1)} [256] L113-1-->L119-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[] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {2810#(= main_~lk3~0 1)} [260] L119-1-->L124-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[] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {2810#(= main_~lk3~0 1)} [265] L124-1-->L130: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {2810#(= main_~lk3~0 1)} is VALID [2022-04-14 23:27:16,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {2810#(= main_~lk3~0 1)} [267] L130-->L170-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {2806#false} is VALID [2022-04-14 23:27:16,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {2806#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2806#false} is VALID [2022-04-14 23:27:16,337 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:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956126109] [2022-04-14 23:27:16,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956126109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:16,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558370850] [2022-04-14 23:27:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:16,338 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:16,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:16,339 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:16,353 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:16,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:16,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:16,354 INFO L87 Difference]: Start difference. First operand 149 states and 259 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:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,546 INFO L93 Difference]: Finished difference Result 275 states and 484 transitions. [2022-04-14 23:27:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:16,546 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:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:16,546 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:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:27:16,549 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:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-04-14 23:27:16,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-04-14 23:27:16,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:16,663 INFO L225 Difference]: With dead ends: 275 [2022-04-14 23:27:16,663 INFO L226 Difference]: Without dead ends: 275 [2022-04-14 23:27:16,664 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:16,664 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:16,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-14 23:27:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 201. [2022-04-14 23:27:16,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:16,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,671 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,672 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,678 INFO L93 Difference]: Finished difference Result 275 states and 484 transitions. [2022-04-14 23:27:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 484 transitions. [2022-04-14 23:27:16,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:16,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:16,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 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 275 states. [2022-04-14 23:27:16,680 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 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 275 states. [2022-04-14 23:27:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,686 INFO L93 Difference]: Finished difference Result 275 states and 484 transitions. [2022-04-14 23:27:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 484 transitions. [2022-04-14 23:27:16,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:16,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:16,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:16,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 347 transitions. [2022-04-14 23:27:16,692 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 347 transitions. Word has length 24 [2022-04-14 23:27:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:16,692 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 347 transitions. [2022-04-14 23:27:16,692 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:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 347 transitions. [2022-04-14 23:27:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 23:27:16,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:16,693 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:16,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 23:27:16,693 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -314735103, now seen corresponding path program 1 times [2022-04-14 23:27:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:16,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336472547] [2022-04-14 23:27:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:16,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {3849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {3843#true} is VALID [2022-04-14 23:27:16,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3843#true} is VALID [2022-04-14 23:27:16,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3843#true} {3843#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3843#true} is VALID [2022-04-14 23:27:16,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:16,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {3849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {3843#true} is VALID [2022-04-14 23:27:16,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3843#true} is VALID [2022-04-14 23:27:16,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3843#true} is VALID [2022-04-14 23:27:16,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3843#true} is VALID [2022-04-14 23:27:16,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {3843#true} is VALID [2022-04-14 23:27:16,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {3843#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {3843#true} is VALID [2022-04-14 23:27:16,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {3843#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {3843#true} is VALID [2022-04-14 23:27:16,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {3843#true} [234] L73-->L73-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[] {3843#true} is VALID [2022-04-14 23:27:16,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {3843#true} [236] L73-2-->L77-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[] {3843#true} is VALID [2022-04-14 23:27:16,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {3843#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {3848#(= main_~p3~0 0)} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {3848#(= main_~p3~0 0)} [241] L85-1-->L89-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] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {3848#(= main_~p3~0 0)} [243] L89-1-->L93-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] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {3848#(= main_~p3~0 0)} [245] L93-1-->L97-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] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {3848#(= main_~p3~0 0)} [247] L97-1-->L101-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] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {3848#(= main_~p3~0 0)} [249] L101-1-->L105-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] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#(= main_~p3~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(= main_~p3~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {3848#(= main_~p3~0 0)} [256] L113-1-->L119-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[] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {3848#(= main_~p3~0 0)} [260] L119-1-->L124-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[] {3848#(= main_~p3~0 0)} is VALID [2022-04-14 23:27:16,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {3848#(= main_~p3~0 0)} [265] L124-1-->L130: Formula: (not (= v_main_~p3~0_4 0)) InVars {main_~p3~0=v_main_~p3~0_4} OutVars{main_~p3~0=v_main_~p3~0_4} AuxVars[] AssignedVars[] {3844#false} is VALID [2022-04-14 23:27:16,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} [267] L130-->L170-1: Formula: (not (= v_main_~lk3~0_4 1)) InVars {main_~lk3~0=v_main_~lk3~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_4} AuxVars[] AssignedVars[] {3844#false} is VALID [2022-04-14 23:27:16,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3844#false} is VALID [2022-04-14 23:27:16,790 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:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336472547] [2022-04-14 23:27:16,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336472547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:16,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:16,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470541041] [2022-04-14 23:27:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:16,791 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:16,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:16,791 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:16,810 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:16,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:16,811 INFO L87 Difference]: Start difference. First operand 201 states and 347 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:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:16,986 INFO L93 Difference]: Finished difference Result 283 states and 484 transitions. [2022-04-14 23:27:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:16,986 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:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:16,986 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:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-14 23:27:16,988 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:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-04-14 23:27:16,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 137 transitions. [2022-04-14 23:27:17,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:17,109 INFO L225 Difference]: With dead ends: 283 [2022-04-14 23:27:17,109 INFO L226 Difference]: Without dead ends: 283 [2022-04-14 23:27:17,110 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:17,110 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:17,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-14 23:27:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2022-04-14 23:27:17,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:17,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,117 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,118 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,125 INFO L93 Difference]: Finished difference Result 283 states and 484 transitions. [2022-04-14 23:27:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 484 transitions. [2022-04-14 23:27:17,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 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 283 states. [2022-04-14 23:27:17,128 INFO L87 Difference]: Start difference. First operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 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 283 states. [2022-04-14 23:27:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,134 INFO L93 Difference]: Finished difference Result 283 states and 484 transitions. [2022-04-14 23:27:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 484 transitions. [2022-04-14 23:27:17,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:17,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 483 transitions. [2022-04-14 23:27:17,142 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 483 transitions. Word has length 24 [2022-04-14 23:27:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:17,142 INFO L478 AbstractCegarLoop]: Abstraction has 281 states and 483 transitions. [2022-04-14 23:27:17,142 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:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 483 transitions. [2022-04-14 23:27:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:17,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:17,143 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:17,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 23:27:17,143 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1620594170, now seen corresponding path program 1 times [2022-04-14 23:27:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458020588] [2022-04-14 23:27:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:17,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:17,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {4991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {4985#true} is VALID [2022-04-14 23:27:17,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {4985#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4985#true} is VALID [2022-04-14 23:27:17,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4985#true} {4985#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4985#true} is VALID [2022-04-14 23:27:17,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {4985#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:17,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {4991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {4985#true} is VALID [2022-04-14 23:27:17,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4985#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4985#true} is VALID [2022-04-14 23:27:17,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4985#true} {4985#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4985#true} is VALID [2022-04-14 23:27:17,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {4985#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4985#true} is VALID [2022-04-14 23:27:17,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {4985#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {4985#true} is VALID [2022-04-14 23:27:17,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {4985#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {4985#true} is VALID [2022-04-14 23:27:17,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {4985#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {4985#true} is VALID [2022-04-14 23:27:17,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {4985#true} [234] L73-->L73-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[] {4985#true} is VALID [2022-04-14 23:27:17,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {4985#true} [236] L73-2-->L77-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[] {4985#true} is VALID [2022-04-14 23:27:17,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {4985#true} [237] L77-1-->L81-1: Formula: (and (not (= v_main_~p3~0_2 0)) (= v_main_~lk3~0_3 1)) InVars {main_~p3~0=v_main_~p3~0_2} OutVars{main_~p3~0=v_main_~p3~0_2, main_~lk3~0=v_main_~lk3~0_3} AuxVars[] AssignedVars[main_~lk3~0] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {4990#(not (= main_~p3~0 0))} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {4990#(not (= main_~p3~0 0))} [241] L85-1-->L89-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] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {4990#(not (= main_~p3~0 0))} [243] L89-1-->L93-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] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {4990#(not (= main_~p3~0 0))} [245] L93-1-->L97-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] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {4990#(not (= main_~p3~0 0))} [247] L97-1-->L101-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] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {4990#(not (= main_~p3~0 0))} [249] L101-1-->L105-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] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {4990#(not (= main_~p3~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {4990#(not (= main_~p3~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#(not (= main_~p3~0 0))} [256] L113-1-->L119-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[] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {4990#(not (= main_~p3~0 0))} [260] L119-1-->L124-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[] {4990#(not (= main_~p3~0 0))} is VALID [2022-04-14 23:27:17,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {4990#(not (= main_~p3~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {4986#false} is VALID [2022-04-14 23:27:17,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {4986#false} [269] L129-1-->L135: Formula: (not (= 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[] {4986#false} is VALID [2022-04-14 23:27:17,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#false} [271] L135-->L170-1: Formula: (not (= v_main_~lk4~0_6 1)) InVars {main_~lk4~0=v_main_~lk4~0_6} OutVars{main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[] {4986#false} is VALID [2022-04-14 23:27:17,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {4986#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4986#false} is VALID [2022-04-14 23:27:17,214 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:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458020588] [2022-04-14 23:27:17,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458020588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:17,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:17,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758853298] [2022-04-14 23:27:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:17,215 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:17,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:17,215 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:17,230 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:17,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:17,231 INFO L87 Difference]: Start difference. First operand 281 states and 483 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:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,415 INFO L93 Difference]: Finished difference Result 287 states and 484 transitions. [2022-04-14 23:27:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:17,415 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:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:17,416 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:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:27:17,417 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:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:27:17,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-14 23:27:17,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:17,528 INFO L225 Difference]: With dead ends: 287 [2022-04-14 23:27:17,528 INFO L226 Difference]: Without dead ends: 287 [2022-04-14 23:27:17,528 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:17,529 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:17,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-14 23:27:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-14 23:27:17,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:17,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,535 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,536 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,542 INFO L93 Difference]: Finished difference Result 287 states and 484 transitions. [2022-04-14 23:27:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 484 transitions. [2022-04-14 23:27:17,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 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 287 states. [2022-04-14 23:27:17,544 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 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 287 states. [2022-04-14 23:27:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,550 INFO L93 Difference]: Finished difference Result 287 states and 484 transitions. [2022-04-14 23:27:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 484 transitions. [2022-04-14 23:27:17,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:17,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 483 transitions. [2022-04-14 23:27:17,557 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 483 transitions. Word has length 25 [2022-04-14 23:27:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:17,557 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 483 transitions. [2022-04-14 23:27:17,557 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:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 483 transitions. [2022-04-14 23:27:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:17,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:17,558 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:17,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 23:27:17,558 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1166821317, now seen corresponding path program 1 times [2022-04-14 23:27:17,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857943408] [2022-04-14 23:27:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:17,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {6149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {6143#true} is VALID [2022-04-14 23:27:17,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {6143#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6143#true} {6143#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {6143#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:17,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {6149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {6143#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6143#true} {6143#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {6143#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {6143#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {6143#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {6143#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {6143#true} is VALID [2022-04-14 23:27:17,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {6143#true} [234] L73-->L73-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[] {6143#true} is VALID [2022-04-14 23:27:17,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {6143#true} [236] L73-2-->L77-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[] {6143#true} is VALID [2022-04-14 23:27:17,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {6143#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {6143#true} is VALID [2022-04-14 23:27:17,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {6143#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {6148#(= main_~p4~0 0)} [241] L85-1-->L89-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] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {6148#(= main_~p4~0 0)} [243] L89-1-->L93-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] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {6148#(= main_~p4~0 0)} [245] L93-1-->L97-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] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {6148#(= main_~p4~0 0)} [247] L97-1-->L101-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] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {6148#(= main_~p4~0 0)} [249] L101-1-->L105-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] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {6148#(= main_~p4~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {6148#(= main_~p4~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {6148#(= main_~p4~0 0)} [256] L113-1-->L119-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[] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {6148#(= main_~p4~0 0)} [260] L119-1-->L124-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[] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {6148#(= main_~p4~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {6148#(= main_~p4~0 0)} is VALID [2022-04-14 23:27:17,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {6148#(= main_~p4~0 0)} [269] L129-1-->L135: Formula: (not (= 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[] {6144#false} is VALID [2022-04-14 23:27:17,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {6144#false} [271] L135-->L170-1: Formula: (not (= v_main_~lk4~0_6 1)) InVars {main_~lk4~0=v_main_~lk4~0_6} OutVars{main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[] {6144#false} is VALID [2022-04-14 23:27:17,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {6144#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6144#false} is VALID [2022-04-14 23:27:17,604 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:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:17,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857943408] [2022-04-14 23:27:17,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857943408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:17,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:17,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106838231] [2022-04-14 23:27:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:17,605 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:17,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:17,605 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:17,621 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:17,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:17,622 INFO L87 Difference]: Start difference. First operand 285 states and 483 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:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,816 INFO L93 Difference]: Finished difference Result 547 states and 912 transitions. [2022-04-14 23:27:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:17,817 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:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:17,817 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:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:27:17,818 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:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-14 23:27:17,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-14 23:27:17,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:17,938 INFO L225 Difference]: With dead ends: 547 [2022-04-14 23:27:17,938 INFO L226 Difference]: Without dead ends: 547 [2022-04-14 23:27:17,939 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:17,939 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:17,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 87 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-14 23:27:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-14 23:27:17,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:17,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,949 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,950 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,966 INFO L93 Difference]: Finished difference Result 547 states and 912 transitions. [2022-04-14 23:27:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 912 transitions. [2022-04-14 23:27:17,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 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 547 states. [2022-04-14 23:27:17,970 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 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 547 states. [2022-04-14 23:27:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:17,986 INFO L93 Difference]: Finished difference Result 547 states and 912 transitions. [2022-04-14 23:27:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 912 transitions. [2022-04-14 23:27:17,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:17,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:17,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:17,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6783733826247689) internal successors, (908), 541 states have internal predecessors, (908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 911 transitions. [2022-04-14 23:27:18,004 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 911 transitions. Word has length 25 [2022-04-14 23:27:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:18,004 INFO L478 AbstractCegarLoop]: Abstraction has 545 states and 911 transitions. [2022-04-14 23:27:18,004 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:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 911 transitions. [2022-04-14 23:27:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 23:27:18,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:18,005 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:18,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 23:27:18,006 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash -661262692, now seen corresponding path program 1 times [2022-04-14 23:27:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:18,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659829159] [2022-04-14 23:27:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:18,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {8347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {8341#true} is VALID [2022-04-14 23:27:18,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {8341#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8341#true} {8341#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {8341#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:18,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {8347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {8341#true} is VALID [2022-04-14 23:27:18,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {8341#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8341#true} {8341#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {8341#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {8341#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {8341#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {8341#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {8341#true} [234] L73-->L73-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[] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {8341#true} [236] L73-2-->L77-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[] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {8341#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {8341#true} is VALID [2022-04-14 23:27:18,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {8341#true} [239] L81-1-->L85-1: Formula: (and (= v_main_~lk4~0_5 1) (not (= v_main_~p4~0_3 0))) InVars {main_~p4~0=v_main_~p4~0_3} OutVars{main_~p4~0=v_main_~p4~0_3, main_~lk4~0=v_main_~lk4~0_5} AuxVars[] AssignedVars[main_~lk4~0] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {8346#(= main_~lk4~0 1)} [241] L85-1-->L89-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] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {8346#(= main_~lk4~0 1)} [243] L89-1-->L93-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] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {8346#(= main_~lk4~0 1)} [245] L93-1-->L97-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] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {8346#(= main_~lk4~0 1)} [247] L97-1-->L101-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] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {8346#(= main_~lk4~0 1)} [249] L101-1-->L105-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] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {8346#(= main_~lk4~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {8346#(= main_~lk4~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {8346#(= main_~lk4~0 1)} [256] L113-1-->L119-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[] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {8346#(= main_~lk4~0 1)} [260] L119-1-->L124-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[] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {8346#(= main_~lk4~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(= main_~lk4~0 1)} [269] L129-1-->L135: Formula: (not (= 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[] {8346#(= main_~lk4~0 1)} is VALID [2022-04-14 23:27:18,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {8346#(= main_~lk4~0 1)} [271] L135-->L170-1: Formula: (not (= v_main_~lk4~0_6 1)) InVars {main_~lk4~0=v_main_~lk4~0_6} OutVars{main_~lk4~0=v_main_~lk4~0_6} AuxVars[] AssignedVars[] {8342#false} is VALID [2022-04-14 23:27:18,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {8342#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8342#false} is VALID [2022-04-14 23:27:18,047 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:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659829159] [2022-04-14 23:27:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659829159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:18,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:18,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516746149] [2022-04-14 23:27:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:18,048 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:18,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:18,048 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:18,063 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:18,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:18,064 INFO L87 Difference]: Start difference. First operand 545 states and 911 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:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,261 INFO L93 Difference]: Finished difference Result 675 states and 1144 transitions. [2022-04-14 23:27:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:18,262 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:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:18,263 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:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:27:18,264 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:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:27:18,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-14 23:27:18,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:18,375 INFO L225 Difference]: With dead ends: 675 [2022-04-14 23:27:18,376 INFO L226 Difference]: Without dead ends: 675 [2022-04-14 23:27:18,376 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:18,377 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:18,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 132 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-04-14 23:27:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 545. [2022-04-14 23:27:18,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:18,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 675 states. Second operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,388 INFO L74 IsIncluded]: Start isIncluded. First operand 675 states. Second operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,389 INFO L87 Difference]: Start difference. First operand 675 states. Second operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,413 INFO L93 Difference]: Finished difference Result 675 states and 1144 transitions. [2022-04-14 23:27:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1144 transitions. [2022-04-14 23:27:18,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:18,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:18,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 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 675 states. [2022-04-14 23:27:18,417 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 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 675 states. [2022-04-14 23:27:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,439 INFO L93 Difference]: Finished difference Result 675 states and 1144 transitions. [2022-04-14 23:27:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1144 transitions. [2022-04-14 23:27:18,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:18,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:18,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:18,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2022-04-14 23:27:18,457 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 25 [2022-04-14 23:27:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:18,457 INFO L478 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2022-04-14 23:27:18,457 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:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2022-04-14 23:27:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:18,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:18,458 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:18,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 23:27:18,459 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1811690051, now seen corresponding path program 1 times [2022-04-14 23:27:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:18,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686140733] [2022-04-14 23:27:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:18,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {10929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {10923#true} is VALID [2022-04-14 23:27:18,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {10923#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10923#true} {10923#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {10923#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:18,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {10929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {10923#true} is VALID [2022-04-14 23:27:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {10923#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10923#true} {10923#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {10923#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {10923#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {10923#true} is VALID [2022-04-14 23:27:18,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {10923#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {10923#true} is VALID [2022-04-14 23:27:18,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {10923#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {10923#true} is VALID [2022-04-14 23:27:18,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {10923#true} [234] L73-->L73-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[] {10923#true} is VALID [2022-04-14 23:27:18,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {10923#true} [236] L73-2-->L77-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[] {10923#true} is VALID [2022-04-14 23:27:18,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {10923#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {10923#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {10923#true} is VALID [2022-04-14 23:27:18,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {10923#true} [241] L85-1-->L89-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] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {10928#(= main_~lk5~0 1)} [243] L89-1-->L93-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] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {10928#(= main_~lk5~0 1)} [245] L93-1-->L97-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] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {10928#(= main_~lk5~0 1)} [247] L97-1-->L101-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] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {10928#(= main_~lk5~0 1)} [249] L101-1-->L105-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] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {10928#(= main_~lk5~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(= main_~lk5~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(= main_~lk5~0 1)} [256] L113-1-->L119-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[] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {10928#(= main_~lk5~0 1)} [260] L119-1-->L124-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[] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {10928#(= main_~lk5~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {10928#(= main_~lk5~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {10928#(= main_~lk5~0 1)} [273] L134-1-->L140: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {10928#(= main_~lk5~0 1)} is VALID [2022-04-14 23:27:18,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {10928#(= main_~lk5~0 1)} [275] L140-->L170-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {10924#false} is VALID [2022-04-14 23:27:18,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {10924#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10924#false} is VALID [2022-04-14 23:27:18,522 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:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:18,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686140733] [2022-04-14 23:27:18,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686140733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:18,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:18,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912659742] [2022-04-14 23:27:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:18,523 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:18,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:18,524 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:18,540 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:18,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:18,541 INFO L87 Difference]: Start difference. First operand 545 states and 903 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:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,777 INFO L93 Difference]: Finished difference Result 995 states and 1664 transitions. [2022-04-14 23:27:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:18,777 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:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:18,777 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:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:18,779 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:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:18,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-14 23:27:18,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:18,931 INFO L225 Difference]: With dead ends: 995 [2022-04-14 23:27:18,931 INFO L226 Difference]: Without dead ends: 995 [2022-04-14 23:27:18,932 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:18,932 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:18,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-04-14 23:27:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 769. [2022-04-14 23:27:18,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:18,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 995 states. Second operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,948 INFO L74 IsIncluded]: Start isIncluded. First operand 995 states. Second operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,949 INFO L87 Difference]: Start difference. First operand 995 states. Second operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:18,994 INFO L93 Difference]: Finished difference Result 995 states and 1664 transitions. [2022-04-14 23:27:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1664 transitions. [2022-04-14 23:27:18,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:18,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:18,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 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 995 states. [2022-04-14 23:27:18,999 INFO L87 Difference]: Start difference. First operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 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 995 states. [2022-04-14 23:27:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:19,045 INFO L93 Difference]: Finished difference Result 995 states and 1664 transitions. [2022-04-14 23:27:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1664 transitions. [2022-04-14 23:27:19,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:19,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:19,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:19,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 765 states have (on average 1.6261437908496732) internal successors, (1244), 765 states have internal predecessors, (1244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1247 transitions. [2022-04-14 23:27:19,081 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1247 transitions. Word has length 26 [2022-04-14 23:27:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:19,082 INFO L478 AbstractCegarLoop]: Abstraction has 769 states and 1247 transitions. [2022-04-14 23:27:19,082 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:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1247 transitions. [2022-04-14 23:27:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 23:27:19,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:19,083 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:19,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 23:27:19,083 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1977718620, now seen corresponding path program 1 times [2022-04-14 23:27:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913854245] [2022-04-14 23:27:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:19,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {14695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {14689#true} is VALID [2022-04-14 23:27:19,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14689#true} {14689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {14689#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:19,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {14695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {14689#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14689#true} {14689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {14689#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {14689#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {14689#true} is VALID [2022-04-14 23:27:19,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {14689#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {14689#true} is VALID [2022-04-14 23:27:19,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {14689#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {14689#true} is VALID [2022-04-14 23:27:19,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {14689#true} [234] L73-->L73-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[] {14689#true} is VALID [2022-04-14 23:27:19,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {14689#true} [236] L73-2-->L77-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[] {14689#true} is VALID [2022-04-14 23:27:19,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {14689#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {14689#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {14689#true} is VALID [2022-04-14 23:27:19,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {14689#true} [242] L85-1-->L89-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[] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {14694#(= main_~p5~0 0)} [243] L89-1-->L93-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] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {14694#(= main_~p5~0 0)} [245] L93-1-->L97-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] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {14694#(= main_~p5~0 0)} [247] L97-1-->L101-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] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {14694#(= main_~p5~0 0)} [249] L101-1-->L105-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] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {14694#(= main_~p5~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {14694#(= main_~p5~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {14694#(= main_~p5~0 0)} [256] L113-1-->L119-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[] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {14694#(= main_~p5~0 0)} [260] L119-1-->L124-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[] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {14694#(= main_~p5~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {14694#(= main_~p5~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {14694#(= main_~p5~0 0)} is VALID [2022-04-14 23:27:19,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {14694#(= main_~p5~0 0)} [273] L134-1-->L140: Formula: (not (= v_main_~p5~0_1 0)) InVars {main_~p5~0=v_main_~p5~0_1} OutVars{main_~p5~0=v_main_~p5~0_1} AuxVars[] AssignedVars[] {14690#false} is VALID [2022-04-14 23:27:19,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {14690#false} [275] L140-->L170-1: Formula: (not (= v_main_~lk5~0_2 1)) InVars {main_~lk5~0=v_main_~lk5~0_2} OutVars{main_~lk5~0=v_main_~lk5~0_2} AuxVars[] AssignedVars[] {14690#false} is VALID [2022-04-14 23:27:19,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {14690#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14690#false} is VALID [2022-04-14 23:27:19,127 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:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:19,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913854245] [2022-04-14 23:27:19,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913854245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:19,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:19,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769385465] [2022-04-14 23:27:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:19,128 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:19,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:19,128 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:19,145 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:19,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:19,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:19,146 INFO L87 Difference]: Start difference. First operand 769 states and 1247 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:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:19,374 INFO L93 Difference]: Finished difference Result 1059 states and 1704 transitions. [2022-04-14 23:27:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:19,374 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:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:19,375 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:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-14 23:27:19,376 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:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-14 23:27:19,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-14 23:27:19,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:19,541 INFO L225 Difference]: With dead ends: 1059 [2022-04-14 23:27:19,541 INFO L226 Difference]: Without dead ends: 1059 [2022-04-14 23:27:19,542 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:19,542 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:19,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-04-14 23:27:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2022-04-14 23:27:19,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:19,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1059 states. Second operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:19,561 INFO L74 IsIncluded]: Start isIncluded. First operand 1059 states. Second operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:19,565 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:19,616 INFO L93 Difference]: Finished difference Result 1059 states and 1704 transitions. [2022-04-14 23:27:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1704 transitions. [2022-04-14 23:27:19,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:19,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:19,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 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 1059 states. [2022-04-14 23:27:19,621 INFO L87 Difference]: Start difference. First operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 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 1059 states. [2022-04-14 23:27:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:19,673 INFO L93 Difference]: Finished difference Result 1059 states and 1704 transitions. [2022-04-14 23:27:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1704 transitions. [2022-04-14 23:27:19,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:19,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:19,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:19,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1053 states have (on average 1.6144349477682811) internal successors, (1700), 1053 states have internal predecessors, (1700), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1703 transitions. [2022-04-14 23:27:19,728 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1703 transitions. Word has length 26 [2022-04-14 23:27:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:19,729 INFO L478 AbstractCegarLoop]: Abstraction has 1057 states and 1703 transitions. [2022-04-14 23:27:19,729 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:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1703 transitions. [2022-04-14 23:27:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:19,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:19,730 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:19,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 23:27:19,730 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:19,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -327784201, now seen corresponding path program 1 times [2022-04-14 23:27:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:19,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867826548] [2022-04-14 23:27:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:19,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {18941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {18935#true} is VALID [2022-04-14 23:27:19,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {18935#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18935#true} {18935#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {18935#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:19,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {18941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {18935#true} is VALID [2022-04-14 23:27:19,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {18935#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18935#true} {18935#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {18935#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {18935#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {18935#true} is VALID [2022-04-14 23:27:19,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {18935#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {18935#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {18935#true} [234] L73-->L73-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[] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {18935#true} [236] L73-2-->L77-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[] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {18935#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {18935#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {18935#true} is VALID [2022-04-14 23:27:19,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {18935#true} [241] L85-1-->L89-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] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {18940#(not (= main_~p5~0 0))} [243] L89-1-->L93-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] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {18940#(not (= main_~p5~0 0))} [245] L93-1-->L97-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] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {18940#(not (= main_~p5~0 0))} [247] L97-1-->L101-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] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {18940#(not (= main_~p5~0 0))} [249] L101-1-->L105-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] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {18940#(not (= main_~p5~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {18940#(not (= main_~p5~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {18940#(not (= main_~p5~0 0))} [256] L113-1-->L119-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[] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {18940#(not (= main_~p5~0 0))} [260] L119-1-->L124-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[] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {18940#(not (= main_~p5~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {18940#(not (= main_~p5~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {18940#(not (= main_~p5~0 0))} is VALID [2022-04-14 23:27:19,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {18940#(not (= main_~p5~0 0))} [274] L134-1-->L139-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[] {18936#false} is VALID [2022-04-14 23:27:19,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {18936#false} [277] L139-1-->L145: 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[] {18936#false} is VALID [2022-04-14 23:27:19,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {18936#false} [279] L145-->L170-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {18936#false} is VALID [2022-04-14 23:27:19,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {18936#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18936#false} is VALID [2022-04-14 23:27:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:27:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:19,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867826548] [2022-04-14 23:27:19,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867826548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:19,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:19,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276244650] [2022-04-14 23:27:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:19,798 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:19,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:19,799 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:19,817 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:19,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:19,818 INFO L87 Difference]: Start difference. First operand 1057 states and 1703 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:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:20,054 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-14 23:27:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:20,054 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:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:20,054 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:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-14 23:27:20,055 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:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-14 23:27:20,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-14 23:27:20,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:20,205 INFO L225 Difference]: With dead ends: 1083 [2022-04-14 23:27:20,205 INFO L226 Difference]: Without dead ends: 1083 [2022-04-14 23:27:20,206 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:20,206 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:20,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-14 23:27:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-14 23:27:20,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:20,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:20,225 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:20,226 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:20,277 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-14 23:27:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-14 23:27:20,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:20,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:20,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-14 23:27:20,282 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-14 23:27:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:20,336 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-14 23:27:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-14 23:27:20,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:20,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:20,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:20,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-14 23:27:20,392 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-14 23:27:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:20,393 INFO L478 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-14 23:27:20,393 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:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-14 23:27:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:20,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:20,394 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:20,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 23:27:20,394 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1179767608, now seen corresponding path program 1 times [2022-04-14 23:27:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:20,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489174915] [2022-04-14 23:27:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:20,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {23283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {23277#true} is VALID [2022-04-14 23:27:20,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {23277#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23277#true} {23277#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {23277#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {23283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {23277#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23277#true} {23277#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {23277#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {23277#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {23277#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {23277#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {23277#true} is VALID [2022-04-14 23:27:20,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {23277#true} [234] L73-->L73-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[] {23277#true} is VALID [2022-04-14 23:27:20,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {23277#true} [236] L73-2-->L77-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[] {23277#true} is VALID [2022-04-14 23:27:20,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {23277#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {23277#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {23277#true} is VALID [2022-04-14 23:27:20,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {23277#true} [242] L85-1-->L89-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[] {23277#true} is VALID [2022-04-14 23:27:20,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {23277#true} [243] L89-1-->L93-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] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {23282#(= main_~lk6~0 1)} [245] L93-1-->L97-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] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {23282#(= main_~lk6~0 1)} [247] L97-1-->L101-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] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {23282#(= main_~lk6~0 1)} [249] L101-1-->L105-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] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {23282#(= main_~lk6~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {23282#(= main_~lk6~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {23282#(= main_~lk6~0 1)} [256] L113-1-->L119-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[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {23282#(= main_~lk6~0 1)} [260] L119-1-->L124-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[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {23282#(= main_~lk6~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {23282#(= main_~lk6~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {23282#(= main_~lk6~0 1)} [274] L134-1-->L139-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[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {23282#(= main_~lk6~0 1)} [277] L139-1-->L145: 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[] {23282#(= main_~lk6~0 1)} is VALID [2022-04-14 23:27:20,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {23282#(= main_~lk6~0 1)} [279] L145-->L170-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {23278#false} is VALID [2022-04-14 23:27:20,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {23278#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23278#false} is VALID [2022-04-14 23:27:20,433 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:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489174915] [2022-04-14 23:27:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489174915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860106566] [2022-04-14 23:27:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:20,434 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:20,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:20,434 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:20,451 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:20,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:20,452 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 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:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:20,774 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-14 23:27:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:20,775 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:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:20,775 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:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:27:20,776 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:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:27:20,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-14 23:27:20,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:21,049 INFO L225 Difference]: With dead ends: 1931 [2022-04-14 23:27:21,049 INFO L226 Difference]: Without dead ends: 1931 [2022-04-14 23:27:21,049 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:21,050 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:21,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-14 23:27:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-14 23:27:21,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:21,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:21,079 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:21,080 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:21,219 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-14 23:27:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-14 23:27:21,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:21,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:21,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-14 23:27:21,227 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-14 23:27:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:21,383 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-14 23:27:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-14 23:27:21,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:21,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:21,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:21,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-14 23:27:21,505 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-14 23:27:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:21,506 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-14 23:27:21,506 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:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-14 23:27:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 23:27:21,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:21,509 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:21,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 23:27:21,509 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash 674208983, now seen corresponding path program 1 times [2022-04-14 23:27:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297354011] [2022-04-14 23:27:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:21,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {30633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {30627#true} is VALID [2022-04-14 23:27:21,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {30627#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30627#true} {30627#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {30627#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:21,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {30633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {30627#true} is VALID [2022-04-14 23:27:21,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {30627#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30627#true} {30627#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {30627#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {30627#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {30627#true} is VALID [2022-04-14 23:27:21,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {30627#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {30627#true} is VALID [2022-04-14 23:27:21,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {30627#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {30627#true} is VALID [2022-04-14 23:27:21,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {30627#true} [234] L73-->L73-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[] {30627#true} is VALID [2022-04-14 23:27:21,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {30627#true} [236] L73-2-->L77-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[] {30627#true} is VALID [2022-04-14 23:27:21,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {30627#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {30627#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {30627#true} is VALID [2022-04-14 23:27:21,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {30627#true} [242] L85-1-->L89-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[] {30627#true} is VALID [2022-04-14 23:27:21,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {30627#true} [244] L89-1-->L93-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[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {30632#(= main_~p6~0 0)} [245] L93-1-->L97-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] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {30632#(= main_~p6~0 0)} [247] L97-1-->L101-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] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {30632#(= main_~p6~0 0)} [249] L101-1-->L105-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] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {30632#(= main_~p6~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {30632#(= main_~p6~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {30632#(= main_~p6~0 0)} [256] L113-1-->L119-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[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {30632#(= main_~p6~0 0)} [260] L119-1-->L124-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[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {30632#(= main_~p6~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {30632#(= main_~p6~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {30632#(= main_~p6~0 0)} [274] L134-1-->L139-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[] {30632#(= main_~p6~0 0)} is VALID [2022-04-14 23:27:21,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {30632#(= main_~p6~0 0)} [277] L139-1-->L145: 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[] {30628#false} is VALID [2022-04-14 23:27:21,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {30628#false} [279] L145-->L170-1: Formula: (not (= v_main_~lk6~0_2 1)) InVars {main_~lk6~0=v_main_~lk6~0_2} OutVars{main_~lk6~0=v_main_~lk6~0_2} AuxVars[] AssignedVars[] {30628#false} is VALID [2022-04-14 23:27:21,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {30628#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30628#false} is VALID [2022-04-14 23:27:21,583 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:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297354011] [2022-04-14 23:27:21,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297354011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:21,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:21,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520005564] [2022-04-14 23:27:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:21,586 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:21,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:21,586 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:21,604 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:21,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:21,605 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 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:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:21,910 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-14 23:27:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:21,911 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:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:21,911 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:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-14 23:27:21,912 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:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-14 23:27:21,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-14 23:27:22,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:22,148 INFO L225 Difference]: With dead ends: 2091 [2022-04-14 23:27:22,149 INFO L226 Difference]: Without dead ends: 2091 [2022-04-14 23:27:22,149 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:22,149 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:22,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-14 23:27:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-14 23:27:22,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:22,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:22,186 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:22,188 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:22,317 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-14 23:27:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-14 23:27:22,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:22,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:22,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-14 23:27:22,325 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-14 23:27:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:22,494 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-14 23:27:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-14 23:27:22,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:22,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:22,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:22,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-14 23:27:22,676 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-14 23:27:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:22,676 INFO L478 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-14 23:27:22,676 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:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-14 23:27:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:22,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:22,678 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:22,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 23:27:22,678 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2081877160, now seen corresponding path program 1 times [2022-04-14 23:27:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:22,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542743370] [2022-04-14 23:27:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:22,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {39007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {39001#true} is VALID [2022-04-14 23:27:22,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {39001#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39001#true} {39001#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {39001#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {39007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {39001#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39001#true} {39001#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {39001#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {39001#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {39001#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {39001#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {39001#true} is VALID [2022-04-14 23:27:22,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {39001#true} [234] L73-->L73-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[] {39001#true} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {39001#true} [236] L73-2-->L77-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[] {39001#true} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {39001#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {39001#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {39001#true} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {39001#true} [242] L85-1-->L89-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[] {39001#true} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {39001#true} [243] L89-1-->L93-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] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {39006#(not (= main_~p6~0 0))} [245] L93-1-->L97-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] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {39006#(not (= main_~p6~0 0))} [247] L97-1-->L101-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] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {39006#(not (= main_~p6~0 0))} [249] L101-1-->L105-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] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {39006#(not (= main_~p6~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {39006#(not (= main_~p6~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {39006#(not (= main_~p6~0 0))} [256] L113-1-->L119-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[] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {39006#(not (= main_~p6~0 0))} [260] L119-1-->L124-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[] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {39006#(not (= main_~p6~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {39006#(not (= main_~p6~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {39006#(not (= main_~p6~0 0))} [274] L134-1-->L139-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[] {39006#(not (= main_~p6~0 0))} is VALID [2022-04-14 23:27:22,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {39006#(not (= main_~p6~0 0))} [278] L139-1-->L144-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[] {39002#false} is VALID [2022-04-14 23:27:22,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {39002#false} [281] L144-1-->L150: 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[] {39002#false} is VALID [2022-04-14 23:27:22,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {39002#false} [283] L150-->L170-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[] {39002#false} is VALID [2022-04-14 23:27:22,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {39002#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39002#false} is VALID [2022-04-14 23:27:22,729 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:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:22,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542743370] [2022-04-14 23:27:22,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542743370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:22,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:22,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937841006] [2022-04-14 23:27:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:22,730 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:22,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:22,730 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:22,748 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:22,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:22,749 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 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:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:23,107 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-14 23:27:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:23,108 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:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:23,108 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:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:27:23,109 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:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-04-14 23:27:23,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-04-14 23:27:23,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:23,411 INFO L225 Difference]: With dead ends: 2123 [2022-04-14 23:27:23,411 INFO L226 Difference]: Without dead ends: 2123 [2022-04-14 23:27:23,411 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:23,412 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:23,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-14 23:27:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-14 23:27:23,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:23,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:23,460 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:23,462 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:23,641 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-14 23:27:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-14 23:27:23,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:23,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:23,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-14 23:27:23,649 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-14 23:27:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:23,791 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-14 23:27:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-14 23:27:23,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:23,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:23,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:23,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-14 23:27:23,923 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-14 23:27:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:23,924 INFO L478 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-14 23:27:23,924 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:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-14 23:27:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:23,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:23,925 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:23,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 23:27:23,925 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -574325351, now seen corresponding path program 1 times [2022-04-14 23:27:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266358048] [2022-04-14 23:27:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:23,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {47509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {47503#true} is VALID [2022-04-14 23:27:23,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {47503#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47503#true} {47503#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {47503#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:23,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {47509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {47503#true} is VALID [2022-04-14 23:27:23,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {47503#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47503#true} {47503#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {47503#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {47503#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {47503#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {47503#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {47503#true} [234] L73-->L73-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[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {47503#true} [236] L73-2-->L77-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[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {47503#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {47503#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {47503#true} [242] L85-1-->L89-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[] {47503#true} is VALID [2022-04-14 23:27:23,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {47503#true} [244] L89-1-->L93-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[] {47503#true} is VALID [2022-04-14 23:27:23,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {47503#true} [245] L93-1-->L97-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] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {47508#(= main_~lk7~0 1)} [247] L97-1-->L101-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] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {47508#(= main_~lk7~0 1)} [249] L101-1-->L105-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] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {47508#(= main_~lk7~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {47508#(= main_~lk7~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {47508#(= main_~lk7~0 1)} [256] L113-1-->L119-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[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {47508#(= main_~lk7~0 1)} [260] L119-1-->L124-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[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {47508#(= main_~lk7~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {47508#(= main_~lk7~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {47508#(= main_~lk7~0 1)} [274] L134-1-->L139-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[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {47508#(= main_~lk7~0 1)} [278] L139-1-->L144-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[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {47508#(= main_~lk7~0 1)} [281] L144-1-->L150: 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[] {47508#(= main_~lk7~0 1)} is VALID [2022-04-14 23:27:23,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {47508#(= main_~lk7~0 1)} [283] L150-->L170-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[] {47504#false} is VALID [2022-04-14 23:27:23,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {47504#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47504#false} is VALID [2022-04-14 23:27:23,976 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:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:23,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266358048] [2022-04-14 23:27:23,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266358048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:23,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:23,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274337203] [2022-04-14 23:27:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:23,977 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:23,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:23,977 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:23,993 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:23,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:23,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:23,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:23,994 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 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:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:24,533 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-14 23:27:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:24,534 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:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:24,534 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:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:27:24,535 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:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-14 23:27:24,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-14 23:27:24,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:25,222 INFO L225 Difference]: With dead ends: 3723 [2022-04-14 23:27:25,222 INFO L226 Difference]: Without dead ends: 3723 [2022-04-14 23:27:25,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:25,223 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:25,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-14 23:27:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-14 23:27:25,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:25,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:25,274 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:25,277 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:25,840 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-14 23:27:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-14 23:27:25,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:25,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:25,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-14 23:27:25,852 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-14 23:27:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:26,258 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-14 23:27:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-14 23:27:26,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:26,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:26,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:26,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-14 23:27:26,652 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-14 23:27:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:26,653 INFO L478 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-14 23:27:26,653 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:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-14 23:27:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 23:27:26,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:26,655 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:26,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 23:27:26,656 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1079883976, now seen corresponding path program 1 times [2022-04-14 23:27:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:26,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726530243] [2022-04-14 23:27:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:26,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {61771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {61765#true} is VALID [2022-04-14 23:27:26,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {61765#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61765#true} {61765#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {61765#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:26,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {61771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {61765#true} is VALID [2022-04-14 23:27:26,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {61765#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61765#true} {61765#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {61765#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {61765#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {61765#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {61765#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {61765#true} [234] L73-->L73-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[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {61765#true} [236] L73-2-->L77-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[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {61765#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {61765#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {61765#true} [242] L85-1-->L89-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[] {61765#true} is VALID [2022-04-14 23:27:26,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {61765#true} [244] L89-1-->L93-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[] {61765#true} is VALID [2022-04-14 23:27:26,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {61765#true} [246] L93-1-->L97-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[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {61770#(= main_~p7~0 0)} [247] L97-1-->L101-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] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {61770#(= main_~p7~0 0)} [249] L101-1-->L105-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] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {61770#(= main_~p7~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {61770#(= main_~p7~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {61770#(= main_~p7~0 0)} [256] L113-1-->L119-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[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {61770#(= main_~p7~0 0)} [260] L119-1-->L124-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[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {61770#(= main_~p7~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {61770#(= main_~p7~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {61770#(= main_~p7~0 0)} [274] L134-1-->L139-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[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {61770#(= main_~p7~0 0)} [278] L139-1-->L144-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[] {61770#(= main_~p7~0 0)} is VALID [2022-04-14 23:27:26,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {61770#(= main_~p7~0 0)} [281] L144-1-->L150: 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[] {61766#false} is VALID [2022-04-14 23:27:26,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {61766#false} [283] L150-->L170-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[] {61766#false} is VALID [2022-04-14 23:27:26,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {61766#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61766#false} is VALID [2022-04-14 23:27:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:27:26,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726530243] [2022-04-14 23:27:26,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726530243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:26,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932914522] [2022-04-14 23:27:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:26,709 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:26,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:26,710 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:26,727 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:26,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:26,728 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 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:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:27,363 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-14 23:27:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:27,364 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:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:27,364 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:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-14 23:27:27,365 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:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-14 23:27:27,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-14 23:27:27,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:27,946 INFO L225 Difference]: With dead ends: 4107 [2022-04-14 23:27:27,946 INFO L226 Difference]: Without dead ends: 4107 [2022-04-14 23:27:27,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:27:27,947 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:27,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-14 23:27:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-14 23:27:28,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:28,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,034 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,037 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,506 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-14 23:27:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-14 23:27:28,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:28,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:28,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-14 23:27:28,517 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-14 23:27:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:28,999 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-14 23:27:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-14 23:27:29,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:29,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:29,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:29,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-14 23:27:29,465 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-14 23:27:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:29,465 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-14 23:27:29,465 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:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-14 23:27:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:29,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:29,467 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:29,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 23:27:29,467 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:29,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash -624183917, now seen corresponding path program 1 times [2022-04-14 23:27:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139101691] [2022-04-14 23:27:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:29,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {78209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {78203#true} is VALID [2022-04-14 23:27:29,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {78203#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78203#true} {78203#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {78203#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:29,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {78209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {78203#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78203#true} {78203#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {78203#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {78203#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {78203#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {78203#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {78203#true} [234] L73-->L73-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[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {78203#true} [236] L73-2-->L77-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[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {78203#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {78203#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {78203#true} is VALID [2022-04-14 23:27:29,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {78203#true} [242] L85-1-->L89-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[] {78203#true} is VALID [2022-04-14 23:27:29,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {78203#true} [244] L89-1-->L93-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[] {78203#true} is VALID [2022-04-14 23:27:29,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {78203#true} [245] L93-1-->L97-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] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {78208#(not (= main_~p7~0 0))} [247] L97-1-->L101-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] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {78208#(not (= main_~p7~0 0))} [249] L101-1-->L105-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] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {78208#(not (= main_~p7~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {78208#(not (= main_~p7~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {78208#(not (= main_~p7~0 0))} [256] L113-1-->L119-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[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {78208#(not (= main_~p7~0 0))} [260] L119-1-->L124-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[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {78208#(not (= main_~p7~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {78208#(not (= main_~p7~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {78208#(not (= main_~p7~0 0))} [274] L134-1-->L139-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[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {78208#(not (= main_~p7~0 0))} [278] L139-1-->L144-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[] {78208#(not (= main_~p7~0 0))} is VALID [2022-04-14 23:27:29,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {78208#(not (= main_~p7~0 0))} [282] L144-1-->L149-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[] {78204#false} is VALID [2022-04-14 23:27:29,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {78204#false} [285] L149-1-->L155: 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[] {78204#false} is VALID [2022-04-14 23:27:29,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {78204#false} [287] L155-->L170-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[] {78204#false} is VALID [2022-04-14 23:27:29,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {78204#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78204#false} is VALID [2022-04-14 23:27:29,505 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,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139101691] [2022-04-14 23:27:29,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139101691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:29,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:29,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325028795] [2022-04-14 23:27:29,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:29,506 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:29,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:29,506 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:29,524 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:29,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:29,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:29,525 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 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:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:30,188 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-14 23:27:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:30,188 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:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:30,188 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:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-14 23:27:30,189 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:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-04-14 23:27:30,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-04-14 23:27:30,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:30,812 INFO L225 Difference]: With dead ends: 4171 [2022-04-14 23:27:30,812 INFO L226 Difference]: Without dead ends: 4171 [2022-04-14 23:27:30,812 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,812 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:30,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-14 23:27:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-14 23:27:30,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:30,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,869 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,873 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,370 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-14 23:27:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-14 23:27:31,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-14 23:27:31,379 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-14 23:27:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:31,856 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-14 23:27:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-14 23:27:31,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:31,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:31,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:31,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (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,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-14 23:27:32,328 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-14 23:27:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:32,329 INFO L478 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-14 23:27:32,329 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:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-14 23:27:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:32,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:32,332 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:32,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 23:27:32,332 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 883367892, now seen corresponding path program 1 times [2022-04-14 23:27:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:32,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33091347] [2022-04-14 23:27:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:32,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {94903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {94897#true} is VALID [2022-04-14 23:27:32,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {94897#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94897#true} {94897#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {94897#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:32,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {94903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {94897#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94897#true} {94897#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {94897#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {94897#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {94897#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {94897#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {94897#true} [234] L73-->L73-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[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {94897#true} [236] L73-2-->L77-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[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {94897#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {94897#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {94897#true} is VALID [2022-04-14 23:27:32,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {94897#true} [242] L85-1-->L89-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[] {94897#true} is VALID [2022-04-14 23:27:32,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {94897#true} [244] L89-1-->L93-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[] {94897#true} is VALID [2022-04-14 23:27:32,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {94897#true} [246] L93-1-->L97-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[] {94897#true} is VALID [2022-04-14 23:27:32,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {94897#true} [247] L97-1-->L101-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] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {94902#(= main_~lk8~0 1)} [249] L101-1-->L105-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] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {94902#(= main_~lk8~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {94902#(= main_~lk8~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {94902#(= main_~lk8~0 1)} [256] L113-1-->L119-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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {94902#(= main_~lk8~0 1)} [260] L119-1-->L124-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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {94902#(= main_~lk8~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {94902#(= main_~lk8~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {94902#(= main_~lk8~0 1)} [274] L134-1-->L139-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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {94902#(= main_~lk8~0 1)} [278] L139-1-->L144-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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {94902#(= main_~lk8~0 1)} [282] L144-1-->L149-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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {94902#(= main_~lk8~0 1)} [285] L149-1-->L155: 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[] {94902#(= main_~lk8~0 1)} is VALID [2022-04-14 23:27:32,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {94902#(= main_~lk8~0 1)} [287] L155-->L170-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[] {94898#false} is VALID [2022-04-14 23:27:32,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {94898#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94898#false} is VALID [2022-04-14 23:27:32,367 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,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:32,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33091347] [2022-04-14 23:27:32,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33091347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:32,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:32,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112621964] [2022-04-14 23:27:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:32,368 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:32,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:32,368 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:32,385 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:32,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:32,386 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 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:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:33,994 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-14 23:27:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:33,995 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,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:33,995 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:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:27:33,996 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:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-14 23:27:33,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-14 23:27:34,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:35,691 INFO L225 Difference]: With dead ends: 7179 [2022-04-14 23:27:35,691 INFO L226 Difference]: Without dead ends: 7179 [2022-04-14 23:27:35,691 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,692 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:35,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:27:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-14 23:27:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-14 23:27:35,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:35,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (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,789 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (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,795 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (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,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:37,361 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-14 23:27:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-14 23:27:37,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:37,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:37,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-14 23:27:37,376 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-14 23:27:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:38,839 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-14 23:27:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-14 23:27:38,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:38,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:38,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:38,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (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,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-14 23:27:40,101 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-14 23:27:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:40,101 INFO L478 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-14 23:27:40,101 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:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-14 23:27:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 23:27:40,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:40,104 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:40,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 23:27:40,104 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 377809267, now seen corresponding path program 1 times [2022-04-14 23:27:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:40,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122794692] [2022-04-14 23:27:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:40,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {122605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {122599#true} is VALID [2022-04-14 23:27:40,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {122599#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122599#true} {122599#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {122599#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:40,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {122605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {122599#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122599#true} {122599#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {122599#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {122599#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {122599#true} is VALID [2022-04-14 23:27:40,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {122599#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {122599#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {122599#true} [234] L73-->L73-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[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {122599#true} [236] L73-2-->L77-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[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {122599#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {122599#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {122599#true} [242] L85-1-->L89-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[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {122599#true} [244] L89-1-->L93-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[] {122599#true} is VALID [2022-04-14 23:27:40,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {122599#true} [246] L93-1-->L97-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[] {122599#true} is VALID [2022-04-14 23:27:40,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {122599#true} [248] L97-1-->L101-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {122604#(= main_~p8~0 0)} [249] L101-1-->L105-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] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {122604#(= main_~p8~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {122604#(= main_~p8~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {122604#(= main_~p8~0 0)} [256] L113-1-->L119-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {122604#(= main_~p8~0 0)} [260] L119-1-->L124-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {122604#(= main_~p8~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {122604#(= main_~p8~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {122604#(= main_~p8~0 0)} [274] L134-1-->L139-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {122604#(= main_~p8~0 0)} [278] L139-1-->L144-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {122604#(= main_~p8~0 0)} [282] L144-1-->L149-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[] {122604#(= main_~p8~0 0)} is VALID [2022-04-14 23:27:40,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {122604#(= main_~p8~0 0)} [285] L149-1-->L155: 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[] {122600#false} is VALID [2022-04-14 23:27:40,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {122600#false} [287] L155-->L170-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[] {122600#false} is VALID [2022-04-14 23:27:40,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {122600#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122600#false} is VALID [2022-04-14 23:27:40,143 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,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122794692] [2022-04-14 23:27:40,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122794692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:40,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822112213] [2022-04-14 23:27:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:40,144 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:40,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:40,144 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:40,161 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:40,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:40,162 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 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:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:42,105 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-14 23:27:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-14 23:27:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:27:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-14 23:27:42,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-14 23:27:42,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:43,913 INFO L225 Difference]: With dead ends: 8075 [2022-04-14 23:27:43,914 INFO L226 Difference]: Without dead ends: 8075 [2022-04-14 23:27:43,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:27:43,915 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:43,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-14 23:27:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-14 23:27:43,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:44,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,017 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,027 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:45,733 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-14 23:27:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-14 23:27:45,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:45,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:45,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-14 23:27:45,752 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-14 23:27:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:47,589 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-14 23:27:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-14 23:27:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:47,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:47,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:47,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-14 23:27:49,386 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-14 23:27:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:49,387 INFO L478 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-14 23:27:49,387 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:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-14 23:27:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:49,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:49,392 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:49,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 23:27:49,392 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1614633780, now seen corresponding path program 1 times [2022-04-14 23:27:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:49,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526315939] [2022-04-14 23:27:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:49,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {154915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {154909#true} is VALID [2022-04-14 23:27:49,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {154909#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154909#true} {154909#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {154909#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:49,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {154915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {154909#true} is VALID [2022-04-14 23:27:49,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {154909#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154909#true} {154909#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {154909#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {154909#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {154909#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {154909#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {154909#true} [234] L73-->L73-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[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {154909#true} [236] L73-2-->L77-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[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {154909#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {154909#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {154909#true} [242] L85-1-->L89-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[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {154909#true} [244] L89-1-->L93-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[] {154909#true} is VALID [2022-04-14 23:27:49,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {154909#true} [246] L93-1-->L97-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[] {154909#true} is VALID [2022-04-14 23:27:49,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {154909#true} [247] L97-1-->L101-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] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {154914#(not (= main_~p8~0 0))} [249] L101-1-->L105-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] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {154914#(not (= main_~p8~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {154914#(not (= main_~p8~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {154914#(not (= main_~p8~0 0))} [256] L113-1-->L119-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[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {154914#(not (= main_~p8~0 0))} [260] L119-1-->L124-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[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {154914#(not (= main_~p8~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {154914#(not (= main_~p8~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {154914#(not (= main_~p8~0 0))} [274] L134-1-->L139-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[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {154914#(not (= main_~p8~0 0))} [278] L139-1-->L144-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[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {154914#(not (= main_~p8~0 0))} [282] L144-1-->L149-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[] {154914#(not (= main_~p8~0 0))} is VALID [2022-04-14 23:27:49,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {154914#(not (= main_~p8~0 0))} [286] L149-1-->L154-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[] {154910#false} is VALID [2022-04-14 23:27:49,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {154910#false} [289] L154-1-->L160: 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[] {154910#false} is VALID [2022-04-14 23:27:49,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {154910#false} [291] L160-->L170-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[] {154910#false} is VALID [2022-04-14 23:27:49,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {154910#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154910#false} is VALID [2022-04-14 23:27:49,438 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:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:49,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526315939] [2022-04-14 23:27:49,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526315939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:49,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:49,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:49,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121898662] [2022-04-14 23:27:49,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:49,440 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:49,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:49,440 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:49,460 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:49,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:49,461 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 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:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:51,514 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-14 23:27:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:27:51,515 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:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:27:51,515 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:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:51,516 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:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-14 23:27:51,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-14 23:27:51,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:27:53,707 INFO L225 Difference]: With dead ends: 8203 [2022-04-14 23:27:53,707 INFO L226 Difference]: Without dead ends: 8203 [2022-04-14 23:27:53,708 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:53,708 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:27:53,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:27:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-14 23:27:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-14 23:27:53,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:27:53,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,828 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (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,839 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:55,650 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-14 23:27:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-14 23:27:55,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:55,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:55,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-14 23:27:55,675 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-14 23:27:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:27:57,558 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-14 23:27:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-14 23:27:57,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:27:57,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:27:57,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:27:57,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:27:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:27:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-14 23:27:59,646 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-14 23:27:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:27:59,646 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-14 23:27:59,646 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:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-14 23:27:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:27:59,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:27:59,649 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:59,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 23:27:59,650 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:27:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:27:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1172781707, now seen corresponding path program 1 times [2022-04-14 23:27:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:27:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560729732] [2022-04-14 23:27:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:27:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:27:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:27:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:27:59,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {187737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {187731#true} is VALID [2022-04-14 23:27:59,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {187731#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187731#true} {187731#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {187731#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:27:59,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {187737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {187731#true} is VALID [2022-04-14 23:27:59,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {187731#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187731#true} {187731#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {187731#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {187731#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {187731#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {187731#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {187731#true} [234] L73-->L73-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[] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {187731#true} [236] L73-2-->L77-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[] {187731#true} is VALID [2022-04-14 23:27:59,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {187731#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {187731#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {187731#true} [242] L85-1-->L89-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[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {187731#true} [244] L89-1-->L93-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[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {187731#true} [246] L93-1-->L97-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[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {187731#true} [248] L97-1-->L101-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[] {187731#true} is VALID [2022-04-14 23:27:59,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {187731#true} [249] L101-1-->L105-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] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {187736#(= main_~lk9~0 1)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {187736#(= main_~lk9~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {187736#(= main_~lk9~0 1)} [256] L113-1-->L119-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {187736#(= main_~lk9~0 1)} [260] L119-1-->L124-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {187736#(= main_~lk9~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {187736#(= main_~lk9~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {187736#(= main_~lk9~0 1)} [274] L134-1-->L139-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {187736#(= main_~lk9~0 1)} [278] L139-1-->L144-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {187736#(= main_~lk9~0 1)} [282] L144-1-->L149-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {187736#(= main_~lk9~0 1)} [286] L149-1-->L154-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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {187736#(= main_~lk9~0 1)} [289] L154-1-->L160: 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[] {187736#(= main_~lk9~0 1)} is VALID [2022-04-14 23:27:59,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {187736#(= main_~lk9~0 1)} [291] L160-->L170-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[] {187732#false} is VALID [2022-04-14 23:27:59,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {187732#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187732#false} is VALID [2022-04-14 23:27:59,706 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:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:27:59,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560729732] [2022-04-14 23:27:59,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560729732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:27:59,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:27:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:27:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895381422] [2022-04-14 23:27:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:27:59,709 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:59,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:27:59,710 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:59,730 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:59,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:27:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:27:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:27:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:27:59,731 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 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:28:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:05,402 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-14 23:28:05,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:05,402 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:28:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:05,402 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:28:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:28:05,403 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:28:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-04-14 23:28:05,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2022-04-14 23:28:05,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:11,697 INFO L225 Difference]: With dead ends: 13835 [2022-04-14 23:28:11,698 INFO L226 Difference]: Without dead ends: 13835 [2022-04-14 23:28:11,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 23:28:11,698 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:11,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 23:28:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-14 23:28:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-14 23:28:11,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:11,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call 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,894 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call 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,907 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call 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:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:17,077 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-14 23:28:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-14 23:28:17,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:17,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:17,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-14 23:28:17,109 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-14 23:28:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:22,357 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-14 23:28:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-14 23:28:22,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:22,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:22,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:22,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call 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:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-14 23:28:27,122 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-14 23:28:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:28:27,122 INFO L478 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-14 23:28:27,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:28:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-14 23:28:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 23:28:27,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:28:27,127 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:28:27,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 23:28:27,128 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:28:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:28:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1678340332, now seen corresponding path program 1 times [2022-04-14 23:28:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:28:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213920738] [2022-04-14 23:28:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:28:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:28:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:28:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:28:27,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {241551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {241545#true} is VALID [2022-04-14 23:28:27,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {241545#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241545#true} {241545#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {241545#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:28:27,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {241551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {241545#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241545#true} {241545#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {241545#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {241545#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {241545#true} is VALID [2022-04-14 23:28:27,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {241545#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {241545#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {241545#true} [234] L73-->L73-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[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {241545#true} [236] L73-2-->L77-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[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {241545#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {241545#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {241545#true} [242] L85-1-->L89-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[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {241545#true} [244] L89-1-->L93-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[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {241545#true} [246] L93-1-->L97-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[] {241545#true} is VALID [2022-04-14 23:28:27,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {241545#true} [248] L97-1-->L101-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[] {241545#true} is VALID [2022-04-14 23:28:27,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {241545#true} [250] L101-1-->L105-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {241550#(= main_~p9~0 0)} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {241550#(= main_~p9~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {241550#(= main_~p9~0 0)} [256] L113-1-->L119-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {241550#(= main_~p9~0 0)} [260] L119-1-->L124-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {241550#(= main_~p9~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {241550#(= main_~p9~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {241550#(= main_~p9~0 0)} [274] L134-1-->L139-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {241550#(= main_~p9~0 0)} [278] L139-1-->L144-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {241550#(= main_~p9~0 0)} [282] L144-1-->L149-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {241550#(= main_~p9~0 0)} [286] L149-1-->L154-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[] {241550#(= main_~p9~0 0)} is VALID [2022-04-14 23:28:27,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {241550#(= main_~p9~0 0)} [289] L154-1-->L160: 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[] {241546#false} is VALID [2022-04-14 23:28:27,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {241546#false} [291] L160-->L170-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[] {241546#false} is VALID [2022-04-14 23:28:27,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {241546#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241546#false} is VALID [2022-04-14 23:28:27,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:28:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:28:27,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213920738] [2022-04-14 23:28:27,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213920738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:28:27,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:28:27,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:28:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759641667] [2022-04-14 23:28:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:28:27,168 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:28:27,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:28:27,168 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:28:27,186 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:28:27,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:28:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:28:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:28:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:28:27,186 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 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:28:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:34,312 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-14 23:28:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:28:34,312 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:28:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:28:34,313 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:28:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-04-14 23:28:34,313 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:28:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-04-14 23:28:34,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 125 transitions. [2022-04-14 23:28:34,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:28:41,947 INFO L225 Difference]: With dead ends: 15883 [2022-04-14 23:28:41,947 INFO L226 Difference]: Without dead ends: 15883 [2022-04-14 23:28:41,947 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:41,947 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:28:41,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:28:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-14 23:28:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-14 23:28:42,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:28:42,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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,106 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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,121 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:48,495 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-14 23:28:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-14 23:28:48,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:48,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:48,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-14 23:28:48,528 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-14 23:28:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:28:55,203 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-14 23:28:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-14 23:28:55,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:28:55,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:28:55,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:28:55,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:28:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-14 23:29:02,421 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-14 23:29:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:02,421 INFO L478 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-14 23:29:02,421 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:29:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-14 23:29:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:29:02,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:02,427 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:29:02,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 23:29:02,427 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1996461521, now seen corresponding path program 1 times [2022-04-14 23:29:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:02,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373697550] [2022-04-14 23:29:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:02,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {305093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {305087#true} is VALID [2022-04-14 23:29:02,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {305087#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {305087#true} {305087#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {305087#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:02,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {305093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {305087#true} is VALID [2022-04-14 23:29:02,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {305087#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305087#true} {305087#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {305087#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {305087#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {305087#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {305087#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {305087#true} [234] L73-->L73-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[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {305087#true} [236] L73-2-->L77-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[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {305087#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {305087#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {305087#true} is VALID [2022-04-14 23:29:02,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {305087#true} [242] L85-1-->L89-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[] {305087#true} is VALID [2022-04-14 23:29:02,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {305087#true} [244] L89-1-->L93-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[] {305087#true} is VALID [2022-04-14 23:29:02,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {305087#true} [246] L93-1-->L97-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[] {305087#true} is VALID [2022-04-14 23:29:02,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {305087#true} [248] L97-1-->L101-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[] {305087#true} is VALID [2022-04-14 23:29:02,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {305087#true} [249] L101-1-->L105-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] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {305092#(not (= main_~p9~0 0))} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {305092#(not (= main_~p9~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {305092#(not (= main_~p9~0 0))} [256] L113-1-->L119-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {305092#(not (= main_~p9~0 0))} [260] L119-1-->L124-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {305092#(not (= main_~p9~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {305092#(not (= main_~p9~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {305092#(not (= main_~p9~0 0))} [274] L134-1-->L139-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {305092#(not (= main_~p9~0 0))} [278] L139-1-->L144-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {305092#(not (= main_~p9~0 0))} [282] L144-1-->L149-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {305092#(not (= main_~p9~0 0))} [286] L149-1-->L154-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[] {305092#(not (= main_~p9~0 0))} is VALID [2022-04-14 23:29:02,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {305092#(not (= main_~p9~0 0))} [290] L154-1-->L159-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[] {305088#false} is VALID [2022-04-14 23:29:02,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {305088#false} [293] L159-1-->L165: 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[] {305088#false} is VALID [2022-04-14 23:29:02,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {305088#false} [295] L165-->L170-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[] {305088#false} is VALID [2022-04-14 23:29:02,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {305088#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305088#false} is VALID [2022-04-14 23:29:02,462 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:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373697550] [2022-04-14 23:29:02,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373697550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:02,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:02,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743819389] [2022-04-14 23:29:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-14 23:29:02,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:02,463 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:29:02,482 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:29:02,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:02,483 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:09,024 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-14 23:29:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:29:09,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-14 23:29:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:29:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-14 23:29:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-14 23:29:09,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-14 23:29:09,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:29:16,540 INFO L225 Difference]: With dead ends: 16139 [2022-04-14 23:29:16,541 INFO L226 Difference]: Without dead ends: 16139 [2022-04-14 23:29:16,541 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:16,541 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:29:16,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:29:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-14 23:29:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-14 23:29:16,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:29:16,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:16,683 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:16,699 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:23,818 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-14 23:29:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-14 23:29:23,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:23,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:23,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-14 23:29:23,855 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-14 23:29:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:29:30,773 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-14 23:29:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-14 23:29:30,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:29:30,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:29:30,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:29:30,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:29:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call 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:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-14 23:29:38,967 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-14 23:29:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:29:38,967 INFO L478 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-14 23:29:38,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:29:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-14 23:29:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:29:38,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:29:38,973 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:29:38,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 23:29:38,973 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:29:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:29:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash -488909712, now seen corresponding path program 1 times [2022-04-14 23:29:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:29:38,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235499040] [2022-04-14 23:29:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:29:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:29:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:29:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:29:39,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {369659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {369653#true} is VALID [2022-04-14 23:29:39,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {369653#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {369653#true} {369653#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {369653#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {369659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {369653#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369653#true} {369653#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {369653#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {369653#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {369653#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {369653#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {369653#true} [234] L73-->L73-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[] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {369653#true} [236] L73-2-->L77-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[] {369653#true} is VALID [2022-04-14 23:29:39,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {369653#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {369653#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {369653#true} [242] L85-1-->L89-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[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {369653#true} [244] L89-1-->L93-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[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {369653#true} [246] L93-1-->L97-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[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {369653#true} [248] L97-1-->L101-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[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {369653#true} [250] L101-1-->L105-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[] {369653#true} is VALID [2022-04-14 23:29:39,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {369653#true} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {369658#(= main_~lk10~0 1)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {369658#(= main_~lk10~0 1)} [256] L113-1-->L119-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {369658#(= main_~lk10~0 1)} [260] L119-1-->L124-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {369658#(= main_~lk10~0 1)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {369658#(= main_~lk10~0 1)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {369658#(= main_~lk10~0 1)} [274] L134-1-->L139-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {369658#(= main_~lk10~0 1)} [278] L139-1-->L144-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {369658#(= main_~lk10~0 1)} [282] L144-1-->L149-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {369658#(= main_~lk10~0 1)} [286] L149-1-->L154-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {369658#(= main_~lk10~0 1)} [290] L154-1-->L159-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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {369658#(= main_~lk10~0 1)} [293] L159-1-->L165: 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[] {369658#(= main_~lk10~0 1)} is VALID [2022-04-14 23:29:39,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {369658#(= main_~lk10~0 1)} [295] L165-->L170-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[] {369654#false} is VALID [2022-04-14 23:29:39,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {369654#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369654#false} is VALID [2022-04-14 23:29:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:29:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:29:39,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235499040] [2022-04-14 23:29:39,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235499040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:29:39,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:29:39,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:29:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391005673] [2022-04-14 23:29:39,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:29:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-14 23:29:39,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:29:39,023 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:29:39,041 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:29:39,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:29:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:29:39,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:29:39,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:29:39,042 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 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:30:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:30:34,145 INFO L93 Difference]: Finished difference Result 26635 states and 33032 transitions. [2022-04-14 23:30:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:30:34,145 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:30:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:30:34,146 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:30:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:30:34,146 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:30:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-14 23:30:34,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-14 23:30:34,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:31:08,545 INFO L225 Difference]: With dead ends: 26635 [2022-04-14 23:31:08,546 INFO L226 Difference]: Without dead ends: 26635 [2022-04-14 23:31:08,546 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:08,546 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:31:08,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:31:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26635 states. [2022-04-14 23:31:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26635 to 24585. [2022-04-14 23:31:08,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:31:08,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26635 states. Second operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 2 states have call 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:08,828 INFO L74 IsIncluded]: Start isIncluded. First operand 26635 states. Second operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 2 states have call 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:08,854 INFO L87 Difference]: Start difference. First operand 26635 states. Second operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 2 states have call 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:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:31:36,108 INFO L93 Difference]: Finished difference Result 26635 states and 33032 transitions. [2022-04-14 23:31:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26635 states and 33032 transitions. [2022-04-14 23:31:36,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:31:36,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:31:36,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 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 26635 states. [2022-04-14 23:31:36,186 INFO L87 Difference]: Start difference. First operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 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 26635 states. [2022-04-14 23:32:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:32:05,294 INFO L93 Difference]: Finished difference Result 26635 states and 33032 transitions. [2022-04-14 23:32:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26635 states and 33032 transitions. [2022-04-14 23:32:05,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:32:05,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:32:05,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:32:05,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:32:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24585 states, 24581 states have (on average 1.2186648224238232) internal successors, (29956), 24581 states have internal predecessors, (29956), 2 states have call successors, (2), 2 states have call 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:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24585 states to 24585 states and 29959 transitions. [2022-04-14 23:33:07,415 INFO L78 Accepts]: Start accepts. Automaton has 24585 states and 29959 transitions. Word has length 31 [2022-04-14 23:33:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:33:07,415 INFO L478 AbstractCegarLoop]: Abstraction has 24585 states and 29959 transitions. [2022-04-14 23:33:07,415 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:33:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24585 states and 29959 transitions. [2022-04-14 23:33:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 23:33:07,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:33:07,446 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:33:07,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 23:33:07,446 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:33:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:33:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -994468337, now seen corresponding path program 1 times [2022-04-14 23:33:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:33:07,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021045368] [2022-04-14 23:33:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:33:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:33:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:33:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:33:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:33:07,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {474161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {474155#true} is VALID [2022-04-14 23:33:07,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {474155#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {474155#true} {474155#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {474155#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:33:07,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {474161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {474155#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474155#true} {474155#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {474155#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {474155#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {474155#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {474155#true} is VALID [2022-04-14 23:33:07,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {474155#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {474155#true} [234] L73-->L73-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {474155#true} [236] L73-2-->L77-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {474155#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {474155#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {474155#true} [242] L85-1-->L89-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {474155#true} [244] L89-1-->L93-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {474155#true} [246] L93-1-->L97-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {474155#true} [248] L97-1-->L101-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[] {474155#true} is VALID [2022-04-14 23:33:07,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {474155#true} [250] L101-1-->L105-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[] {474155#true} is VALID [2022-04-14 23:33:07,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {474155#true} [252] L105-1-->L109-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {474160#(= main_~p10~0 0)} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {474160#(= main_~p10~0 0)} [256] L113-1-->L119-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {474160#(= main_~p10~0 0)} [260] L119-1-->L124-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {474160#(= main_~p10~0 0)} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {474160#(= main_~p10~0 0)} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {474160#(= main_~p10~0 0)} [274] L134-1-->L139-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {474160#(= main_~p10~0 0)} [278] L139-1-->L144-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {474160#(= main_~p10~0 0)} [282] L144-1-->L149-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {474160#(= main_~p10~0 0)} [286] L149-1-->L154-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {474160#(= main_~p10~0 0)} [290] L154-1-->L159-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[] {474160#(= main_~p10~0 0)} is VALID [2022-04-14 23:33:07,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {474160#(= main_~p10~0 0)} [293] L159-1-->L165: 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[] {474156#false} is VALID [2022-04-14 23:33:07,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {474156#false} [295] L165-->L170-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[] {474156#false} is VALID [2022-04-14 23:33:07,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {474156#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474156#false} is VALID [2022-04-14 23:33:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 23:33:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:33:07,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021045368] [2022-04-14 23:33:07,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021045368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:33:07,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:33:07,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:33:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946930049] [2022-04-14 23:33:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:33:07,487 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:33:07,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:33:07,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:33:07,507 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:33:07,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:33:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:33:07,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:33:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:33:07,508 INFO L87 Difference]: Start difference. First operand 24585 states and 29959 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:34:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:34:38,074 INFO L93 Difference]: Finished difference Result 31243 states and 36872 transitions. [2022-04-14 23:34:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:34:38,074 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:34:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:34:38,075 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:34:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-14 23:34:38,076 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:34:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-14 23:34:38,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-14 23:34:38,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:36:20,139 INFO L225 Difference]: With dead ends: 31243 [2022-04-14 23:36:20,139 INFO L226 Difference]: Without dead ends: 31243 [2022-04-14 23:36:20,139 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:36:20,140 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:36:20,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:36:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-14 23:36:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-14 23:36:20,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:36:20,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:36:20,526 INFO L74 IsIncluded]: Start isIncluded. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:36:20,618 INFO L87 Difference]: Start difference. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:36:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:36:52,638 INFO L93 Difference]: Finished difference Result 31243 states and 36872 transitions. [2022-04-14 23:36:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 36872 transitions. [2022-04-14 23:36:52,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:36:52,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:36:52,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 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 31243 states. [2022-04-14 23:36:52,739 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 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 31243 states. [2022-04-14 23:38:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:38:22,371 INFO L93 Difference]: Finished difference Result 31243 states and 36872 transitions. [2022-04-14 23:38:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 36872 transitions. [2022-04-14 23:38:22,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 23:38:22,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 23:38:22,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 23:38:22,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 23:38:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call 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:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 36871 transitions. [2022-04-14 23:38:53,726 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 36871 transitions. Word has length 31 [2022-04-14 23:38:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 23:38:53,726 INFO L478 AbstractCegarLoop]: Abstraction has 31241 states and 36871 transitions. [2022-04-14 23:38:53,727 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:38:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 36871 transitions. [2022-04-14 23:38:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 23:38:53,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 23:38:53,740 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:38:53,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-14 23:38:53,740 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 23:38:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 23:38:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2023701264, now seen corresponding path program 1 times [2022-04-14 23:38:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 23:38:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091757681] [2022-04-14 23:38:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 23:38:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 23:38:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:38:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 23:38:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 23:38:53,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {599143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {599137#true} is VALID [2022-04-14 23:38:53,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {599137#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {599137#true} {599137#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {599137#true} [220] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 23:38:53,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {599143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [222] 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] {599137#true} is VALID [2022-04-14 23:38:53,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {599137#true} [225] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {599137#true} {599137#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {599137#true} [221] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {599137#true} [224] mainENTRY-->L169-1: Formula: (and (= v_main_~p5~0_2 |v_main_#t~nondet8_2|) (<= |v_main_#t~nondet8_2| 2147483647) (= v_main_~p9~0_1 |v_main_#t~nondet12_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~p7~0_1 |v_main_#t~nondet10_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= |v_main_#t~nondet14_2| 2147483647) (<= |v_main_#t~nondet13_2| 2147483647) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~p1~0_1 |v_main_#t~nondet4_2|) (= v_main_~p6~0_1 |v_main_#t~nondet9_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~p3~0_1 |v_main_#t~nondet6_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (= |v_main_#t~nondet14_2| v_main_~p11~0_1) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~p2~0_1 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~p8~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet13_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet12_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (<= |v_main_#t~nondet11_2| 2147483647) (<= |v_main_#t~nondet10_2| 2147483647) (= |v_main_#t~nondet13_2| v_main_~p10~0_1) (<= |v_main_#t~nondet12_2| 2147483647) (<= 0 (+ |v_main_#t~nondet14_2| 2147483648)) (= v_main_~p4~0_2 |v_main_#t~nondet7_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet14=|v_main_#t~nondet14_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet13=|v_main_#t~nondet13_2|, main_#t~nondet6=|v_main_#t~nondet6_2|, main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet11=|v_main_#t~nondet11_2|, main_#t~nondet8=|v_main_#t~nondet8_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~lk3~0=v_main_~lk3~0_1, main_~p1~0=v_main_~p1~0_1, main_~lk1~0=v_main_~lk1~0_1, main_~p8~0=v_main_~p8~0_1, main_~lk5~0=v_main_~lk5~0_1, main_~lk10~0=v_main_~lk10~0_1, main_~p2~0=v_main_~p2~0_1, main_~p11~0=v_main_~p11~0_1, main_~lk9~0=v_main_~lk9~0_1, main_~p4~0=v_main_~p4~0_2, main_~cond~0=v_main_~cond~0_1, main_~p6~0=v_main_~p6~0_1, main_~lk7~0=v_main_~lk7~0_1, main_~p5~0=v_main_~p5~0_2, main_~lk2~0=v_main_~lk2~0_1, main_~lk11~0=v_main_~lk11~0_1, main_~lk4~0=v_main_~lk4~0_3, main_~p3~0=v_main_~p3~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_~lk8~0=v_main_~lk8~0_1, main_~p7~0=v_main_~p7~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~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~nondet14, main_#t~nondet13, main_~lk4~0, main_~p3~0, main_#t~nondet12, main_#t~nondet11, main_~lk8~0, main_#t~nondet10, main_~p7~0] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {599137#true} [228] L169-1-->L46: Formula: (and (= |v_main_#t~nondet15_2| v_main_~cond~0_2) (<= 0 (+ |v_main_#t~nondet15_2| 2147483648)) (<= |v_main_#t~nondet15_2| 2147483647)) InVars {main_#t~nondet15=|v_main_#t~nondet15_2|} OutVars{main_~cond~0=v_main_~cond~0_2} AuxVars[] AssignedVars[main_#t~nondet15, main_~cond~0] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {599137#true} [231] L46-->L73: Formula: (and (= v_main_~lk9~0_2 0) (= v_main_~lk1~0_2 0) (= v_main_~lk3~0_2 0) (= v_main_~lk7~0_2 0) (= v_main_~lk6~0_3 0) (= v_main_~lk5~0_5 0) (= v_main_~lk2~0_2 0) (= v_main_~lk8~0_2 0) (not (= 0 v_main_~cond~0_4)) (= v_main_~lk11~0_2 0) (= v_main_~lk10~0_2 0) (= v_main_~lk4~0_4 0)) InVars {main_~cond~0=v_main_~cond~0_4} OutVars{main_~lk3~0=v_main_~lk3~0_2, main_~lk1~0=v_main_~lk1~0_2, main_~lk10~0=v_main_~lk10~0_2, main_~lk5~0=v_main_~lk5~0_5, main_~lk9~0=v_main_~lk9~0_2, main_~lk7~0=v_main_~lk7~0_2, main_~cond~0=v_main_~cond~0_4, main_~lk2~0=v_main_~lk2~0_2, main_~lk11~0=v_main_~lk11~0_2, main_~lk4~0=v_main_~lk4~0_4, main_~lk6~0=v_main_~lk6~0_3, main_~lk8~0=v_main_~lk8~0_2} AuxVars[] AssignedVars[main_~lk2~0, main_~lk3~0, main_~lk11~0, main_~lk1~0, main_~lk10~0, main_~lk5~0, main_~lk4~0, main_~lk6~0, main_~lk9~0, main_~lk8~0, main_~lk7~0] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {599137#true} [234] L73-->L73-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {599137#true} [236] L73-2-->L77-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {599137#true} [238] L77-1-->L81-1: Formula: (= v_main_~p3~0_3 0) InVars {main_~p3~0=v_main_~p3~0_3} OutVars{main_~p3~0=v_main_~p3~0_3} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {599137#true} [240] L81-1-->L85-1: Formula: (= v_main_~p4~0_4 0) InVars {main_~p4~0=v_main_~p4~0_4} OutVars{main_~p4~0=v_main_~p4~0_4} AuxVars[] AssignedVars[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {599137#true} [242] L85-1-->L89-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {599137#true} [244] L89-1-->L93-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {599137#true} [246] L93-1-->L97-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {599137#true} [248] L97-1-->L101-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[] {599137#true} is VALID [2022-04-14 23:38:53,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {599137#true} [250] L101-1-->L105-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[] {599137#true} is VALID [2022-04-14 23:38:53,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {599137#true} [251] L105-1-->L109-1: Formula: (and (= v_main_~lk10~0_6 1) (not (= v_main_~p10~0_4 0))) InVars {main_~p10~0=v_main_~p10~0_4} OutVars{main_~lk10~0=v_main_~lk10~0_6, main_~p10~0=v_main_~p10~0_4} AuxVars[] AssignedVars[main_~lk10~0] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {599142#(not (= main_~p10~0 0))} [253] L109-1-->L113-1: Formula: (and (= v_main_~lk11~0_6 1) (not (= v_main_~p11~0_4 0))) InVars {main_~p11~0=v_main_~p11~0_4} OutVars{main_~lk11~0=v_main_~lk11~0_6, main_~p11~0=v_main_~p11~0_4} AuxVars[] AssignedVars[main_~lk11~0] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {599142#(not (= main_~p10~0 0))} [256] L113-1-->L119-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {599142#(not (= main_~p10~0 0))} [260] L119-1-->L124-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {599142#(not (= main_~p10~0 0))} [266] L124-1-->L129-1: Formula: (= v_main_~p3~0_5 0) InVars {main_~p3~0=v_main_~p3~0_5} OutVars{main_~p3~0=v_main_~p3~0_5} AuxVars[] AssignedVars[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {599142#(not (= main_~p10~0 0))} [270] L129-1-->L134-1: Formula: (= v_main_~p4~0_1 0) InVars {main_~p4~0=v_main_~p4~0_1} OutVars{main_~p4~0=v_main_~p4~0_1} AuxVars[] AssignedVars[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {599142#(not (= main_~p10~0 0))} [274] L134-1-->L139-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {599142#(not (= main_~p10~0 0))} [278] L139-1-->L144-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {599142#(not (= main_~p10~0 0))} [282] L144-1-->L149-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {599142#(not (= main_~p10~0 0))} [286] L149-1-->L154-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {599142#(not (= main_~p10~0 0))} [290] L154-1-->L159-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[] {599142#(not (= main_~p10~0 0))} is VALID [2022-04-14 23:38:53,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {599142#(not (= main_~p10~0 0))} [294] L159-1-->L164-1: Formula: (= v_main_~p10~0_3 0) InVars {main_~p10~0=v_main_~p10~0_3} OutVars{main_~p10~0=v_main_~p10~0_3} AuxVars[] AssignedVars[] {599138#false} is VALID [2022-04-14 23:38:53,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {599138#false} [297] L164-1-->L170: Formula: (not (= v_main_~p11~0_2 0)) InVars {main_~p11~0=v_main_~p11~0_2} OutVars{main_~p11~0=v_main_~p11~0_2} AuxVars[] AssignedVars[] {599138#false} is VALID [2022-04-14 23:38:53,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {599138#false} [299] L170-->L170-1: Formula: (not (= v_main_~lk11~0_3 1)) InVars {main_~lk11~0=v_main_~lk11~0_3} OutVars{main_~lk11~0=v_main_~lk11~0_3} AuxVars[] AssignedVars[] {599138#false} is VALID [2022-04-14 23:38:53,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {599138#false} [261] L170-1-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {599138#false} is VALID [2022-04-14 23:38:53,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:38:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 23:38:53,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091757681] [2022-04-14 23:38:53,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091757681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 23:38:53,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 23:38:53,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 23:38:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519778515] [2022-04-14 23:38:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 23:38:53,780 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:38:53,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 23:38:53,780 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:38:53,801 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:38:53,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 23:38:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 23:38:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 23:38:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 23:38:53,802 INFO L87 Difference]: Start difference. First operand 31241 states and 36871 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:40:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 23:40:23,613 INFO L93 Difference]: Finished difference Result 31755 states and 36872 transitions. [2022-04-14 23:40:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 23:40:23,614 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:40:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 23:40:23,614 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:40:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:40:23,615 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:40:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2022-04-14 23:40:23,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2022-04-14 23:40:23,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 23:41:25,812 INFO L225 Difference]: With dead ends: 31755 [2022-04-14 23:41:25,813 INFO L226 Difference]: Without dead ends: 31755 [2022-04-14 23:41:25,813 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:41:25,813 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 23:41:25,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 96 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 23:41:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31755 states. [2022-04-14 23:41:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31755 to 31753. [2022-04-14 23:41:26,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 23:41:26,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31755 states. Second operand has 31753 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:41:26,203 INFO L74 IsIncluded]: Start isIncluded. First operand 31755 states. Second operand has 31753 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 23:41:26,241 INFO L87 Difference]: Start difference. First operand 31755 states. Second operand has 31753 states, 31749 states have (on average 1.1612334246747928) internal successors, (36868), 31749 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)