/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:58:57,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:58:57,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:58:57,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:58:57,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:58:57,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:58:57,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:58:57,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:58:57,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:58:57,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:58:57,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:58:57,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:58:57,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:58:57,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:58:57,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:58:57,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:58:57,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:58:57,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:58:57,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:58:57,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:58:57,777 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:58:57,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:58:57,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:58:57,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:58:57,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:58:57,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:58:57,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:58:57,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:58:57,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:58:57,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:58:57,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:58:57,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:58:57,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:58:57,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:58:57,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:58:57,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:58:57,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:58:57,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:58:57,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:58:57,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:58:57,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:58:57,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:58:57,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:58:57,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:58:57,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:58:57,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:58:57,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:58:57,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:58:57,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:58:57,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:58:57,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:58:57,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:58:57,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:57,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:58:57,798 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 14:58:57,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:58:57,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:58:57,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:58:57,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:58:57,997 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:58:57,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 14:58:58,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ed388b9/824fa71e92c24fe4a2f68d2d9d997fab/FLAGa0b5bf351 [2022-04-08 14:58:58,417 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:58:58,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 14:58:58,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ed388b9/824fa71e92c24fe4a2f68d2d9d997fab/FLAGa0b5bf351 [2022-04-08 14:58:58,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ed388b9/824fa71e92c24fe4a2f68d2d9d997fab [2022-04-08 14:58:58,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:58:58,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:58:58,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:58,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:58:58,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:58:58,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:58" (1/1) ... [2022-04-08 14:58:58,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4165a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:58, skipping insertion in model container [2022-04-08 14:58:58,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:58:58" (1/1) ... [2022-04-08 14:58:58,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:58:58,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:58:59,032 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_8.c[3218,3231] [2022-04-08 14:58:59,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:59,041 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:58:59,070 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_8.c[3218,3231] [2022-04-08 14:58:59,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:58:59,082 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:58:59,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59 WrapperNode [2022-04-08 14:58:59,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:58:59,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:58:59,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:58:59,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:58:59,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:58:59,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:58:59,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:58:59,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:58:59,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (1/1) ... [2022-04-08 14:58:59,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:58:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:58:59,140 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-08 14:58:59,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-08 14:58:59,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:58:59,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:58:59,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:58:59,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:58:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:58:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:58:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:58:59,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:58:59,249 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:58:59,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:58:59,407 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:58:59,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:58:59,411 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:58:59,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:59 BoogieIcfgContainer [2022-04-08 14:58:59,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:58:59,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:58:59,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:58:59,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:58:59,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:58:58" (1/3) ... [2022-04-08 14:58:59,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c12cd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:59, skipping insertion in model container [2022-04-08 14:58:59,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:58:59" (2/3) ... [2022-04-08 14:58:59,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c12cd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:58:59, skipping insertion in model container [2022-04-08 14:58:59,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:58:59" (3/3) ... [2022-04-08 14:58:59,417 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-08 14:58:59,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:58:59,420 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:58:59,444 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:58:59,447 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 14:58:59,448 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:58:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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-08 14:58:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:58:59,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:59,463 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:59,464 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-08 14:58:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678875899] [2022-04-08 14:58:59,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-04-08 14:58:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:59,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555756256] [2022-04-08 14:58:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:59,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 14:58:59,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 14:58:59,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-08 14:58:59,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:59,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 14:58:59,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 14:58:59,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-08 14:58:59,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-08 14:58:59,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2022-04-08 14:58:59,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {42#true} is VALID [2022-04-08 14:58:59,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {42#true} is VALID [2022-04-08 14:58:59,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 14:58:59,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-08 14:58:59,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 14:58:59,728 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-08 14:58:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555756256] [2022-04-08 14:58:59,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555756256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:59,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:59,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:59,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678875899] [2022-04-08 14:58:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678875899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:59,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805470843] [2022-04-08 14:58:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-08 14:58:59,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:59,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:59,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:59,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:59,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:59,798 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,017 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-08 14:59:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-08 14:59:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:59:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:59:00,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 14:59:00,134 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-08 14:59:00,149 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:59:00,150 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:59:00,152 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-08 14:59:00,154 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:00,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:59:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:59:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-08 14:59:00,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:00,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,179 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,179 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,183 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 14:59:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 14:59:00,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-08 14:59:00,184 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-08 14:59:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,188 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 14:59:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 14:59:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:00,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-08 14:59:00,192 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-08 14:59:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:00,192 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-08 14:59:00,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 74 transitions. [2022-04-08 14:59:00,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-08 14:59:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 14:59:00,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:00,264 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:00,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:59:00,265 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-08 14:59:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22310809] [2022-04-08 14:59:00,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-04-08 14:59:00,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:00,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668291368] [2022-04-08 14:59:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-08 14:59:00,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-08 14:59:00,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-08 14:59:00,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:00,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-08 14:59:00,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-08 14:59:00,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-08 14:59:00,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret13 := main(); {414#true} is VALID [2022-04-08 14:59:00,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {414#true} is VALID [2022-04-08 14:59:00,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {414#true} is VALID [2022-04-08 14:59:00,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {414#true} is VALID [2022-04-08 14:59:00,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#true} assume !(0 != ~p1~0); {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(= main_~p1~0 0)} assume !(0 != ~p2~0); {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 14:59:00,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p1~0; {415#false} is VALID [2022-04-08 14:59:00,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#false} assume 1 != ~lk1~0; {415#false} is VALID [2022-04-08 14:59:00,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-08 14:59:00,316 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-08 14:59:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668291368] [2022-04-08 14:59:00,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668291368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:00,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22310809] [2022-04-08 14:59:00,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22310809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390896528] [2022-04-08 14:59:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-08 14:59:00,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:00,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:00,332 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,463 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-08 14:59:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 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 19 [2022-04-08 14:59:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 14:59:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 14:59:00,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-08 14:59:00,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,574 INFO L225 Difference]: With dead ends: 98 [2022-04-08 14:59:00,574 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:59:00,574 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-08 14:59:00,575 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:00,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:59:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-08 14:59:00,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:00,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,584 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,585 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,587 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 14:59:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 14:59:00,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-08 14:59:00,588 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-08 14:59:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,590 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 14:59:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 14:59:00,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:00,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-08 14:59:00,593 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-08 14:59:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:00,593 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-08 14:59:00,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 102 transitions. [2022-04-08 14:59:00,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-08 14:59:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:59:00,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:00,674 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] [2022-04-08 14:59:00,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:59:00,675 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-08 14:59:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307690441] [2022-04-08 14:59:00,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-04-08 14:59:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714938854] [2022-04-08 14:59:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:00,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-08 14:59:00,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-08 14:59:00,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-08 14:59:00,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:00,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-08 14:59:00,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-08 14:59:00,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-08 14:59:00,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret13 := main(); {862#true} is VALID [2022-04-08 14:59:00,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {862#true} is VALID [2022-04-08 14:59:00,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {862#true} is VALID [2022-04-08 14:59:00,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {862#true} is VALID [2022-04-08 14:59:00,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {862#true} assume 0 != ~p1~0;~lk1~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:59:00,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {863#false} is VALID [2022-04-08 14:59:00,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#false} assume 0 != ~p2~0; {863#false} is VALID [2022-04-08 14:59:00,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#false} assume 1 != ~lk2~0; {863#false} is VALID [2022-04-08 14:59:00,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#false} assume !false; {863#false} is VALID [2022-04-08 14:59:00,722 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-08 14:59:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:00,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714938854] [2022-04-08 14:59:00,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714938854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:00,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307690441] [2022-04-08 14:59:00,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307690441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:00,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612472096] [2022-04-08 14:59:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:00,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:00,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:00,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:00,737 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,857 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-08 14:59:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:59:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 14:59:00,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 14:59:00,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:00,953 INFO L225 Difference]: With dead ends: 91 [2022-04-08 14:59:00,953 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 14:59:00,954 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-08 14:59:00,956 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:00,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 14:59:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-08 14:59:00,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:00,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,971 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,971 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,973 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 14:59:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 14:59:00,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-08 14:59:00,974 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-08 14:59:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:00,976 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 14:59:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 14:59:00,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:00,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:00,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:00,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-08 14:59:00,978 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-08 14:59:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:00,978 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-08 14:59:00,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:00,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 104 transitions. [2022-04-08 14:59:01,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-08 14:59:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:59:01,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:01,056 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] [2022-04-08 14:59:01,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:59:01,056 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-08 14:59:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [728778628] [2022-04-08 14:59:01,057 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-04-08 14:59:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444790934] [2022-04-08 14:59:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-08 14:59:01,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 14:59:01,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-08 14:59:01,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-08 14:59:01,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 14:59:01,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-08 14:59:01,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret13 := main(); {1308#true} is VALID [2022-04-08 14:59:01,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {1308#true} is VALID [2022-04-08 14:59:01,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1308#true} is VALID [2022-04-08 14:59:01,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1308#true} is VALID [2022-04-08 14:59:01,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(0 != ~p1~0); {1308#true} is VALID [2022-04-08 14:59:01,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !(0 != ~p2~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-08 14:59:01,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p2~0; {1309#false} is VALID [2022-04-08 14:59:01,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume 1 != ~lk2~0; {1309#false} is VALID [2022-04-08 14:59:01,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-08 14:59:01,103 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-08 14:59:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444790934] [2022-04-08 14:59:01,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444790934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [728778628] [2022-04-08 14:59:01,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [728778628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331023656] [2022-04-08 14:59:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:01,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:01,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:01,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:01,117 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,237 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-08 14:59:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 14:59:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 14:59:01,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-08 14:59:01,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,327 INFO L225 Difference]: With dead ends: 166 [2022-04-08 14:59:01,327 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 14:59:01,327 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-08 14:59:01,328 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:01,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 14:59:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-08 14:59:01,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:01,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,337 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,337 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,339 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-08 14:59:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-08 14:59:01,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 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 113 states. [2022-04-08 14:59:01,340 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 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 113 states. [2022-04-08 14:59:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,343 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-08 14:59:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-08 14:59:01,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:01,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-08 14:59:01,353 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-08 14:59:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:01,353 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-08 14:59:01,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 189 transitions. [2022-04-08 14:59:01,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-08 14:59:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:59:01,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:01,492 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] [2022-04-08 14:59:01,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:59:01,492 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-08 14:59:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32365166] [2022-04-08 14:59:01,493 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-04-08 14:59:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555022747] [2022-04-08 14:59:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-08 14:59:01,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-08 14:59:01,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-08 14:59:01,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:01,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret13 := main(); {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2100#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2100#true} is VALID [2022-04-08 14:59:01,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2100#true} is VALID [2022-04-08 14:59:01,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#true} assume !(0 != ~p1~0); {2100#true} is VALID [2022-04-08 14:59:01,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#true} assume 0 != ~p2~0;~lk2~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 14:59:01,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2101#false} is VALID [2022-04-08 14:59:01,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-04-08 14:59:01,534 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-08 14:59:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:01,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555022747] [2022-04-08 14:59:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555022747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:01,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32365166] [2022-04-08 14:59:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32365166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948289679] [2022-04-08 14:59:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:01,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:01,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:01,548 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,660 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-08 14:59:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 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 20 [2022-04-08 14:59:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 14:59:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 14:59:01,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-08 14:59:01,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,721 INFO L225 Difference]: With dead ends: 143 [2022-04-08 14:59:01,722 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 14:59:01,722 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-08 14:59:01,722 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:01,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 14:59:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-08 14:59:01,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:01,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,732 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,732 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,735 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-08 14:59:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-08 14:59:01,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-08 14:59:01,736 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-08 14:59:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:01,739 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-08 14:59:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-08 14:59:01,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:01,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:01,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:01,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-08 14:59:01,742 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-08 14:59:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:01,743 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-08 14:59:01,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 187 transitions. [2022-04-08 14:59:01,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-08 14:59:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:59:01,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:01,880 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] [2022-04-08 14:59:01,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:59:01,880 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-08 14:59:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171396178] [2022-04-08 14:59:01,881 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-04-08 14:59:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900002127] [2022-04-08 14:59:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:01,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-08 14:59:01,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 14:59:01,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-08 14:59:01,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:01,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-08 14:59:01,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 14:59:01,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-08 14:59:01,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret13 := main(); {2902#true} is VALID [2022-04-08 14:59:01,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2902#true} is VALID [2022-04-08 14:59:01,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {2902#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2902#true} is VALID [2022-04-08 14:59:01,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {2902#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2902#true} is VALID [2022-04-08 14:59:01,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#true} assume !(0 != ~p1~0); {2902#true} is VALID [2022-04-08 14:59:01,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2902#true} assume !(0 != ~p2~0); {2902#true} is VALID [2022-04-08 14:59:01,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#true} assume 0 != ~p3~0;~lk3~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 14:59:01,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {2907#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2903#false} is VALID [2022-04-08 14:59:01,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-08 14:59:01,940 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-08 14:59:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900002127] [2022-04-08 14:59:01,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900002127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171396178] [2022-04-08 14:59:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171396178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:01,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:01,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014133353] [2022-04-08 14:59:01,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-08 14:59:01,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:01,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:01,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:01,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:01,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:01,954 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,066 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-08 14:59:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-08 14:59:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 14:59:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 14:59:02,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 14:59:02,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,132 INFO L225 Difference]: With dead ends: 203 [2022-04-08 14:59:02,132 INFO L226 Difference]: Without dead ends: 201 [2022-04-08 14:59:02,133 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-08 14:59:02,133 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:02,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-08 14:59:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-08 14:59:02,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:02,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,144 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,144 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,148 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-08 14:59:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-08 14:59:02,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-08 14:59:02,149 INFO L87 Difference]: Start difference. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-08 14:59:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,153 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-08 14:59:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-08 14:59:02,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:02,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-08 14:59:02,157 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-08 14:59:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:02,157 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-08 14:59:02,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 253 transitions. [2022-04-08 14:59:02,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-08 14:59:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:59:02,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:02,358 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] [2022-04-08 14:59:02,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:59:02,358 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-08 14:59:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355181604] [2022-04-08 14:59:02,359 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-04-08 14:59:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:02,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104303964] [2022-04-08 14:59:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-08 14:59:02,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-08 14:59:02,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {4024#true} call ULTIMATE.init(); {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:02,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {4024#true} call #t~ret13 := main(); {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {4024#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {4024#true} is VALID [2022-04-08 14:59:02,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {4024#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4024#true} is VALID [2022-04-08 14:59:02,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {4024#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4024#true} is VALID [2022-04-08 14:59:02,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4024#true} assume !(0 != ~p1~0); {4024#true} is VALID [2022-04-08 14:59:02,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#true} assume !(0 != ~p2~0); {4024#true} is VALID [2022-04-08 14:59:02,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#true} assume !(0 != ~p3~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 14:59:02,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p3~0; {4025#false} is VALID [2022-04-08 14:59:02,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#false} assume 1 != ~lk3~0; {4025#false} is VALID [2022-04-08 14:59:02,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-04-08 14:59:02,391 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-08 14:59:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104303964] [2022-04-08 14:59:02,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104303964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355181604] [2022-04-08 14:59:02,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355181604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758380051] [2022-04-08 14:59:02,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:02,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-08 14:59:02,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:02,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:02,405 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,548 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-08 14:59:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 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 21 [2022-04-08 14:59:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 14:59:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 14:59:02,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-08 14:59:02,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,640 INFO L225 Difference]: With dead ends: 351 [2022-04-08 14:59:02,641 INFO L226 Difference]: Without dead ends: 209 [2022-04-08 14:59:02,641 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-08 14:59:02,642 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:02,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-08 14:59:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-08 14:59:02,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:02,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,655 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,655 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,659 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-08 14:59:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-08 14:59:02,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-08 14:59:02,660 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-08 14:59:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:02,665 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-08 14:59:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-08 14:59:02,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:02,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:02,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:02,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-08 14:59:02,669 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-08 14:59:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:02,669 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-08 14:59:02,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:02,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 343 transitions. [2022-04-08 14:59:02,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-08 14:59:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:59:02,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:02,948 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-08 14:59:02,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:59:02,948 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-08 14:59:02,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311463786] [2022-04-08 14:59:02,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-04-08 14:59:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454705171] [2022-04-08 14:59:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:02,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-08 14:59:02,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-08 14:59:02,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-08 14:59:02,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:02,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-08 14:59:02,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-08 14:59:02,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret13 := main(); {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#true} assume !(0 != ~p1~0); {5570#true} is VALID [2022-04-08 14:59:02,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#true} assume !(0 != ~p2~0); {5570#true} is VALID [2022-04-08 14:59:02,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {5570#true} assume 0 != ~p3~0;~lk3~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:59:02,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5571#false} is VALID [2022-04-08 14:59:02,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {5571#false} assume 0 != ~p4~0; {5571#false} is VALID [2022-04-08 14:59:02,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#false} assume 1 != ~lk4~0; {5571#false} is VALID [2022-04-08 14:59:02,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-08 14:59:02,985 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-08 14:59:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:02,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454705171] [2022-04-08 14:59:02,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454705171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311463786] [2022-04-08 14:59:02,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311463786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:02,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:02,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59204398] [2022-04-08 14:59:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:02,986 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-08 14:59:02,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:02,987 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-08 14:59:02,998 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-08 14:59:02,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:02,999 INFO L87 Difference]: Start difference. First operand 207 states and 343 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-08 14:59:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,117 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-08 14:59:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:03,117 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-08 14:59:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:03,117 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-08 14:59:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 14:59:03,118 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-08 14:59:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 14:59:03,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-08 14:59:03,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:03,201 INFO L225 Difference]: With dead ends: 313 [2022-04-08 14:59:03,201 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 14:59:03,201 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-08 14:59:03,202 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:03,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 14:59:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-08 14:59:03,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:03,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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-08 14:59:03,213 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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-08 14:59:03,213 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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-08 14:59:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,216 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-08 14:59:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-08 14:59:03,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:03,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:03,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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 215 states. [2022-04-08 14:59:03,218 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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 215 states. [2022-04-08 14:59:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,220 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-08 14:59:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-08 14:59:03,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:03,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:03,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:03,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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-08 14:59:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-08 14:59:03,225 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-08 14:59:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:03,225 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-08 14:59:03,225 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-08 14:59:03,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 347 transitions. [2022-04-08 14:59:03,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-08 14:59:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:59:03,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:03,506 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-08 14:59:03,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:59:03,507 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-08 14:59:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689555849] [2022-04-08 14:59:03,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-04-08 14:59:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:03,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111748380] [2022-04-08 14:59:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:03,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-08 14:59:03,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-08 14:59:03,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-08 14:59:03,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {7064#true} call ULTIMATE.init(); {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:03,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-08 14:59:03,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-08 14:59:03,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call #t~ret13 := main(); {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {7064#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume !(0 != ~p1~0); {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume !(0 != ~p2~0); {7064#true} is VALID [2022-04-08 14:59:03,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume !(0 != ~p3~0); {7064#true} is VALID [2022-04-08 14:59:03,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume 0 != ~p4~0;~lk4~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 14:59:03,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7065#false} is VALID [2022-04-08 14:59:03,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-04-08 14:59:03,543 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-08 14:59:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:03,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111748380] [2022-04-08 14:59:03,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111748380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:03,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:03,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:03,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:03,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689555849] [2022-04-08 14:59:03,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689555849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:03,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:03,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646848210] [2022-04-08 14:59:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:03,544 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-08 14:59:03,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:03,545 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-08 14:59:03,556 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-08 14:59:03,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:03,557 INFO L87 Difference]: Start difference. First operand 213 states and 347 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-08 14:59:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,671 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-08 14:59:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:03,672 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-08 14:59:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:03,672 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-08 14:59:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 14:59:03,673 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-08 14:59:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 14:59:03,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-08 14:59:03,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:03,735 INFO L225 Difference]: With dead ends: 381 [2022-04-08 14:59:03,735 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 14:59:03,735 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-08 14:59:03,735 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:03,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 14:59:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-08 14:59:03,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:03,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:03,757 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:03,758 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,763 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-08 14:59:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-08 14:59:03,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:03,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:03,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-08 14:59:03,765 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-08 14:59:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:03,770 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-08 14:59:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-08 14:59:03,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:03,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:03,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:03,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-08 14:59:03,776 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-08 14:59:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:03,777 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-08 14:59:03,777 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-08 14:59:03,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 475 transitions. [2022-04-08 14:59:04,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-08 14:59:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:59:04,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:04,102 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-08 14:59:04,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:59:04,102 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-08 14:59:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:04,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552432117] [2022-04-08 14:59:04,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-04-08 14:59:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29125987] [2022-04-08 14:59:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:04,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-08 14:59:04,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-08 14:59:04,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-08 14:59:04,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {9190#true} call ULTIMATE.init(); {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:04,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-08 14:59:04,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-08 14:59:04,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-08 14:59:04,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret13 := main(); {9190#true} is VALID [2022-04-08 14:59:04,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {9190#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {9190#true} is VALID [2022-04-08 14:59:04,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {9190#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {9190#true} is VALID [2022-04-08 14:59:04,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {9190#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {9190#true} is VALID [2022-04-08 14:59:04,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {9190#true} assume !(0 != ~p1~0); {9190#true} is VALID [2022-04-08 14:59:04,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {9190#true} assume !(0 != ~p2~0); {9190#true} is VALID [2022-04-08 14:59:04,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#true} assume !(0 != ~p3~0); {9190#true} is VALID [2022-04-08 14:59:04,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {9190#true} assume !(0 != ~p4~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 14:59:04,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p4~0; {9191#false} is VALID [2022-04-08 14:59:04,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#false} assume 1 != ~lk4~0; {9191#false} is VALID [2022-04-08 14:59:04,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2022-04-08 14:59:04,178 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-08 14:59:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:04,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29125987] [2022-04-08 14:59:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29125987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:04,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:04,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552432117] [2022-04-08 14:59:04,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552432117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:04,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16735008] [2022-04-08 14:59:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:04,179 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-08 14:59:04,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:04,180 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-08 14:59:04,188 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-08 14:59:04,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:04,188 INFO L87 Difference]: Start difference. First operand 297 states and 475 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-08 14:59:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,370 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-08 14:59:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:04,371 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-08 14:59:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:04,371 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-08 14:59:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 14:59:04,373 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-08 14:59:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 14:59:04,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 14:59:04,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:04,450 INFO L225 Difference]: With dead ends: 685 [2022-04-08 14:59:04,450 INFO L226 Difference]: Without dead ends: 403 [2022-04-08 14:59:04,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:04,452 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:04,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-08 14:59:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-08 14:59:04,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:04,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,507 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,508 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,516 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-08 14:59:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-08 14:59:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:04,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 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 403 states. [2022-04-08 14:59:04,528 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 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 403 states. [2022-04-08 14:59:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:04,536 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-08 14:59:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-08 14:59:04,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:04,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:04,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:04,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-08 14:59:04,561 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-08 14:59:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:04,561 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-08 14:59:04,561 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-08 14:59:04,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 631 transitions. [2022-04-08 14:59:05,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-08 14:59:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:05,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:05,058 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-08 14:59:05,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:59:05,058 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-08 14:59:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:05,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358106748] [2022-04-08 14:59:05,059 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-04-08 14:59:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:05,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834665584] [2022-04-08 14:59:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:05,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:05,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-08 14:59:05,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-08 14:59:05,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-08 14:59:05,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {12180#true} call ULTIMATE.init(); {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:05,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-08 14:59:05,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-08 14:59:05,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-08 14:59:05,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {12180#true} call #t~ret13 := main(); {12180#true} is VALID [2022-04-08 14:59:05,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {12180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {12180#true} is VALID [2022-04-08 14:59:05,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {12180#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {12180#true} is VALID [2022-04-08 14:59:05,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {12180#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {12180#true} is VALID [2022-04-08 14:59:05,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0 != ~p1~0); {12180#true} is VALID [2022-04-08 14:59:05,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0 != ~p2~0); {12180#true} is VALID [2022-04-08 14:59:05,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {12180#true} assume !(0 != ~p3~0); {12180#true} is VALID [2022-04-08 14:59:05,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {12180#true} assume 0 != ~p4~0;~lk4~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:59:05,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12181#false} is VALID [2022-04-08 14:59:05,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {12181#false} assume 0 != ~p5~0; {12181#false} is VALID [2022-04-08 14:59:05,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {12181#false} assume 1 != ~lk5~0; {12181#false} is VALID [2022-04-08 14:59:05,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-04-08 14:59:05,108 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-08 14:59:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:05,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834665584] [2022-04-08 14:59:05,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834665584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:05,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:05,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:05,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358106748] [2022-04-08 14:59:05,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358106748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:05,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:05,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:05,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997481175] [2022-04-08 14:59:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:05,109 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-08 14:59:05,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:05,109 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-08 14:59:05,127 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-08 14:59:05,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:05,128 INFO L87 Difference]: Start difference. First operand 401 states and 631 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-08 14:59:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:05,287 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-08 14:59:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:05,287 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-08 14:59:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:05,288 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-08 14:59:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 14:59:05,289 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-08 14:59:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 14:59:05,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-08 14:59:05,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:05,389 INFO L225 Difference]: With dead ends: 601 [2022-04-08 14:59:05,389 INFO L226 Difference]: Without dead ends: 411 [2022-04-08 14:59:05,390 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-08 14:59:05,390 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:05,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-08 14:59:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-08 14:59:05,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:05,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:05,411 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:05,419 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-08 14:59:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-08 14:59:05,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:05,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:05,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 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 411 states. [2022-04-08 14:59:05,420 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 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 411 states. [2022-04-08 14:59:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:05,428 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-08 14:59:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-08 14:59:05,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:05,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:05,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:05,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-08 14:59:05,437 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-08 14:59:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:05,438 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-08 14:59:05,438 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-08 14:59:05,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 409 states and 631 transitions. [2022-04-08 14:59:05,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-08 14:59:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:05,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:05,999 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-08 14:59:05,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:59:05,999 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-08 14:59:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929757180] [2022-04-08 14:59:06,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-04-08 14:59:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672718167] [2022-04-08 14:59:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:06,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-08 14:59:06,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-08 14:59:06,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {15034#true} call ULTIMATE.init(); {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:06,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {15034#true} call #t~ret13 := main(); {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {15034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {15034#true} is VALID [2022-04-08 14:59:06,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {15034#true} is VALID [2022-04-08 14:59:06,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {15034#true} assume !(0 != ~p1~0); {15034#true} is VALID [2022-04-08 14:59:06,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {15034#true} assume !(0 != ~p2~0); {15034#true} is VALID [2022-04-08 14:59:06,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {15034#true} assume !(0 != ~p3~0); {15034#true} is VALID [2022-04-08 14:59:06,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#true} assume !(0 != ~p4~0); {15034#true} is VALID [2022-04-08 14:59:06,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#true} assume 0 != ~p5~0;~lk5~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 14:59:06,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {15039#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15035#false} is VALID [2022-04-08 14:59:06,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {15035#false} assume !false; {15035#false} is VALID [2022-04-08 14:59:06,048 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-08 14:59:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:06,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672718167] [2022-04-08 14:59:06,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672718167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:06,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:06,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:06,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:06,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929757180] [2022-04-08 14:59:06,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929757180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:06,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:06,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879782029] [2022-04-08 14:59:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:06,049 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-08 14:59:06,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:06,049 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-08 14:59:06,064 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-08 14:59:06,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:06,065 INFO L87 Difference]: Start difference. First operand 409 states and 631 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-08 14:59:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:06,227 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-08 14:59:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:06,228 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-08 14:59:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:06,228 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-08 14:59:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 14:59:06,229 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-08 14:59:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 14:59:06,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 14:59:06,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:06,314 INFO L225 Difference]: With dead ends: 717 [2022-04-08 14:59:06,314 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 14:59:06,314 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-08 14:59:06,314 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:06,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 14:59:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-08 14:59:06,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:06,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,361 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,362 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:06,378 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-08 14:59:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-08 14:59:06,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:06,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:06,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-08 14:59:06,380 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-08 14:59:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:06,398 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-08 14:59:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-08 14:59:06,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:06,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:06,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:06,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-08 14:59:06,416 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-08 14:59:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:06,416 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-08 14:59:06,416 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-08 14:59:06,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 879 transitions. [2022-04-08 14:59:07,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-08 14:59:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:59:07,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:07,201 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-08 14:59:07,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:59:07,201 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-08 14:59:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222222375] [2022-04-08 14:59:07,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-04-08 14:59:07,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:07,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690841256] [2022-04-08 14:59:07,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:07,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-08 14:59:07,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-08 14:59:07,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-08 14:59:07,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {19080#true} call ULTIMATE.init(); {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:07,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-08 14:59:07,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-08 14:59:07,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-08 14:59:07,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {19080#true} call #t~ret13 := main(); {19080#true} is VALID [2022-04-08 14:59:07,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {19080#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {19080#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {19080#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {19080#true} assume !(0 != ~p1~0); {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {19080#true} assume !(0 != ~p2~0); {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {19080#true} assume !(0 != ~p3~0); {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {19080#true} assume !(0 != ~p4~0); {19080#true} is VALID [2022-04-08 14:59:07,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {19080#true} assume !(0 != ~p5~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 14:59:07,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p5~0; {19081#false} is VALID [2022-04-08 14:59:07,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {19081#false} assume 1 != ~lk5~0; {19081#false} is VALID [2022-04-08 14:59:07,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {19081#false} assume !false; {19081#false} is VALID [2022-04-08 14:59:07,253 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-08 14:59:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690841256] [2022-04-08 14:59:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690841256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:07,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:07,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1222222375] [2022-04-08 14:59:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1222222375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:07,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291981371] [2022-04-08 14:59:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:07,255 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-08 14:59:07,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:07,255 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-08 14:59:07,269 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-08 14:59:07,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:07,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:07,270 INFO L87 Difference]: Start difference. First operand 585 states and 879 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-08 14:59:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:07,489 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-08 14:59:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:07,489 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-08 14:59:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:07,489 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-08 14:59:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 14:59:07,491 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-08 14:59:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 14:59:07,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-08 14:59:07,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:07,642 INFO L225 Difference]: With dead ends: 1341 [2022-04-08 14:59:07,642 INFO L226 Difference]: Without dead ends: 779 [2022-04-08 14:59:07,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:07,645 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:07,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-08 14:59:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-08 14:59:07,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:07,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,689 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,690 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:07,708 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-08 14:59:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-08 14:59:07,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:07,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:07,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-08 14:59:07,710 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-08 14:59:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:07,729 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-08 14:59:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-08 14:59:07,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:07,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:07,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:07,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-08 14:59:07,755 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-08 14:59:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:07,756 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-08 14:59:07,756 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-08 14:59:07,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1143 transitions. [2022-04-08 14:59:08,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-08 14:59:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:08,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:08,890 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-08 14:59:08,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:59:08,891 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-08 14:59:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:08,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748274204] [2022-04-08 14:59:08,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-04-08 14:59:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:08,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749345187] [2022-04-08 14:59:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:08,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-08 14:59:08,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-08 14:59:08,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-08 14:59:08,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {24886#true} call ULTIMATE.init(); {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:08,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-08 14:59:08,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-08 14:59:08,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {24886#true} call #t~ret13 := main(); {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {24886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {24886#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {24886#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {24886#true} assume !(0 != ~p1~0); {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {24886#true} assume !(0 != ~p2~0); {24886#true} is VALID [2022-04-08 14:59:08,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {24886#true} assume !(0 != ~p3~0); {24886#true} is VALID [2022-04-08 14:59:08,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {24886#true} assume !(0 != ~p4~0); {24886#true} is VALID [2022-04-08 14:59:08,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {24886#true} assume 0 != ~p5~0;~lk5~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:59:08,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24887#false} is VALID [2022-04-08 14:59:08,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#false} assume 0 != ~p6~0; {24887#false} is VALID [2022-04-08 14:59:08,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#false} assume 1 != ~lk6~0; {24887#false} is VALID [2022-04-08 14:59:08,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-04-08 14:59:08,938 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-08 14:59:08,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:08,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749345187] [2022-04-08 14:59:08,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749345187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:08,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:08,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:08,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748274204] [2022-04-08 14:59:08,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748274204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:08,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:08,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027308989] [2022-04-08 14:59:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:08,940 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-08 14:59:08,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:08,940 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-08 14:59:08,956 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-08 14:59:08,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:08,957 INFO L87 Difference]: Start difference. First operand 777 states and 1143 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-08 14:59:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,231 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-08 14:59:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:09,231 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-08 14:59:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:09,231 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-08 14:59:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 14:59:09,233 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-08 14:59:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 14:59:09,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 14:59:09,325 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-08 14:59:09,353 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 14:59:09,353 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 14:59:09,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-08 14:59:09,354 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:09,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 14:59:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-08 14:59:09,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:09,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,399 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,400 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,418 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-08 14:59:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-08 14:59:09,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:09,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:09,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-08 14:59:09,421 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-08 14:59:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:09,439 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-08 14:59:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-08 14:59:09,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:09,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:09,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:09,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-08 14:59:09,479 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-08 14:59:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:09,479 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-08 14:59:09,479 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-08 14:59:09,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1143 transitions. [2022-04-08 14:59:10,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-08 14:59:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:10,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:10,547 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-08 14:59:10,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:59:10,547 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-08 14:59:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:10,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [597671973] [2022-04-08 14:59:10,548 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-04-08 14:59:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384183559] [2022-04-08 14:59:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:10,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-08 14:59:10,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-08 14:59:10,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {30404#true} call ULTIMATE.init(); {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:10,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {30404#true} call #t~ret13 := main(); {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {30404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {30404#true} is VALID [2022-04-08 14:59:10,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {30404#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {30404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {30404#true} assume !(0 != ~p1~0); {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {30404#true} assume !(0 != ~p2~0); {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {30404#true} assume !(0 != ~p3~0); {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {30404#true} assume !(0 != ~p4~0); {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {30404#true} assume !(0 != ~p5~0); {30404#true} is VALID [2022-04-08 14:59:10,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {30404#true} assume 0 != ~p6~0;~lk6~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 14:59:10,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {30409#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30405#false} is VALID [2022-04-08 14:59:10,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {30405#false} assume !false; {30405#false} is VALID [2022-04-08 14:59:10,594 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-08 14:59:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384183559] [2022-04-08 14:59:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384183559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:10,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:10,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:10,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [597671973] [2022-04-08 14:59:10,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [597671973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:10,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:10,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441014071] [2022-04-08 14:59:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:10,596 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-08 14:59:10,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:10,596 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-08 14:59:10,612 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-08 14:59:10,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:10,613 INFO L87 Difference]: Start difference. First operand 793 states and 1143 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-08 14:59:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:10,848 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-08 14:59:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:10,848 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-08 14:59:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:10,848 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-08 14:59:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 14:59:10,849 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-08 14:59:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 14:59:10,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 14:59:10,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:10,996 INFO L225 Difference]: With dead ends: 1357 [2022-04-08 14:59:10,997 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 14:59:10,997 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-08 14:59:10,997 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:10,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 14:59:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-08 14:59:11,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:11,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,066 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,066 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:11,111 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-08 14:59:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-08 14:59:11,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:11,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:11,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 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 1355 states. [2022-04-08 14:59:11,115 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 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 1355 states. [2022-04-08 14:59:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:11,159 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-08 14:59:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-08 14:59:11,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:11,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:11,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:11,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-08 14:59:11,226 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-08 14:59:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:11,226 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-08 14:59:11,227 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-08 14:59:11,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1623 transitions. [2022-04-08 14:59:12,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-08 14:59:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:59:12,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:12,711 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-08 14:59:12,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:59:12,711 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-08 14:59:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:12,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192442585] [2022-04-08 14:59:12,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-04-08 14:59:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:12,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308955400] [2022-04-08 14:59:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:12,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-08 14:59:12,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-08 14:59:12,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-08 14:59:12,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {38162#true} call ULTIMATE.init(); {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:12,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-08 14:59:12,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-08 14:59:12,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-08 14:59:12,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {38162#true} call #t~ret13 := main(); {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {38162#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {38162#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {38162#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {38162#true} assume !(0 != ~p1~0); {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {38162#true} assume !(0 != ~p2~0); {38162#true} is VALID [2022-04-08 14:59:12,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {38162#true} assume !(0 != ~p3~0); {38162#true} is VALID [2022-04-08 14:59:12,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {38162#true} assume !(0 != ~p4~0); {38162#true} is VALID [2022-04-08 14:59:12,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {38162#true} assume !(0 != ~p5~0); {38162#true} is VALID [2022-04-08 14:59:12,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {38162#true} assume !(0 != ~p6~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 14:59:12,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p6~0; {38163#false} is VALID [2022-04-08 14:59:12,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {38163#false} assume 1 != ~lk6~0; {38163#false} is VALID [2022-04-08 14:59:12,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {38163#false} assume !false; {38163#false} is VALID [2022-04-08 14:59:12,774 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-08 14:59:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:12,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308955400] [2022-04-08 14:59:12,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308955400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:12,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:12,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:12,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:12,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192442585] [2022-04-08 14:59:12,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192442585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:12,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:12,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087256821] [2022-04-08 14:59:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:12,775 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-08 14:59:12,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:12,775 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-08 14:59:12,787 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-08 14:59:12,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:12,787 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 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-08 14:59:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,220 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-08 14:59:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:13,220 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-08 14:59:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:13,220 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-08 14:59:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 14:59:13,221 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-08 14:59:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 14:59:13,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-08 14:59:13,297 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-08 14:59:13,388 INFO L225 Difference]: With dead ends: 2637 [2022-04-08 14:59:13,388 INFO L226 Difference]: Without dead ends: 1515 [2022-04-08 14:59:13,390 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-08 14:59:13,390 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:13,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-08 14:59:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-08 14:59:13,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:13,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,479 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,531 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-08 14:59:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-08 14:59:13,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:13,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:13,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-08 14:59:13,535 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-08 14:59:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:13,588 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-08 14:59:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-08 14:59:13,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:13,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:13,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:13,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-08 14:59:13,682 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-08 14:59:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:13,682 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-08 14:59:13,683 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-08 14:59:13,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1513 states and 2055 transitions. [2022-04-08 14:59:15,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-08 14:59:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:59:15,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:15,613 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-08 14:59:15,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:59:15,613 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-08 14:59:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:15,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302038431] [2022-04-08 14:59:15,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-04-08 14:59:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:15,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793383252] [2022-04-08 14:59:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:15,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:15,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-08 14:59:15,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-08 14:59:15,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {49504#true} call ULTIMATE.init(); {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {49504#true} call #t~ret13 := main(); {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {49504#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {49504#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#true} assume !(0 != ~p1~0); {49504#true} is VALID [2022-04-08 14:59:15,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#true} assume !(0 != ~p2~0); {49504#true} is VALID [2022-04-08 14:59:15,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#true} assume !(0 != ~p3~0); {49504#true} is VALID [2022-04-08 14:59:15,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {49504#true} assume !(0 != ~p4~0); {49504#true} is VALID [2022-04-08 14:59:15,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {49504#true} assume !(0 != ~p5~0); {49504#true} is VALID [2022-04-08 14:59:15,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {49504#true} assume 0 != ~p6~0;~lk6~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49505#false} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {49505#false} assume 0 != ~p7~0; {49505#false} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {49505#false} assume 1 != ~lk7~0; {49505#false} is VALID [2022-04-08 14:59:15,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {49505#false} assume !false; {49505#false} is VALID [2022-04-08 14:59:15,665 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-08 14:59:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:15,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793383252] [2022-04-08 14:59:15,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793383252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:15,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:15,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:15,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:15,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302038431] [2022-04-08 14:59:15,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302038431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:15,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:15,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917783999] [2022-04-08 14:59:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:15,666 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-08 14:59:15,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:15,667 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-08 14:59:15,678 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-08 14:59:15,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:15,679 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 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-08 14:59:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:16,098 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-08 14:59:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:16,098 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-08 14:59:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:16,099 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-08 14:59:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:59:16,100 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-08 14:59:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:59:16,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 14:59:16,166 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-08 14:59:16,269 INFO L225 Difference]: With dead ends: 2269 [2022-04-08 14:59:16,269 INFO L226 Difference]: Without dead ends: 1547 [2022-04-08 14:59:16,270 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-08 14:59:16,270 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:16,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-08 14:59:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-08 14:59:16,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:16,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,362 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,363 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:16,424 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-08 14:59:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-08 14:59:16,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:16,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:16,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1547 states. [2022-04-08 14:59:16,427 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1547 states. [2022-04-08 14:59:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:16,488 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-08 14:59:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-08 14:59:16,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:16,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:16,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:16,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-08 14:59:16,606 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-08 14:59:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:16,606 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-08 14:59:16,606 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-08 14:59:16,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2055 transitions. [2022-04-08 14:59:18,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-08 14:59:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:59:18,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:18,371 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-08 14:59:18,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:59:18,371 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-08 14:59:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123047026] [2022-04-08 14:59:18,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-04-08 14:59:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721194992] [2022-04-08 14:59:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:18,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-08 14:59:18,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-08 14:59:18,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {60238#true} call ULTIMATE.init(); {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:18,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {60238#true} call #t~ret13 := main(); {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {60238#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {60238#true} is VALID [2022-04-08 14:59:18,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {60238#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {60238#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {60238#true} assume !(0 != ~p1~0); {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {60238#true} assume !(0 != ~p2~0); {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {60238#true} assume !(0 != ~p3~0); {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {60238#true} assume !(0 != ~p4~0); {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {60238#true} assume !(0 != ~p5~0); {60238#true} is VALID [2022-04-08 14:59:18,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {60238#true} assume !(0 != ~p6~0); {60238#true} is VALID [2022-04-08 14:59:18,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {60238#true} assume 0 != ~p7~0;~lk7~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p7~0; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 14:59:18,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {60243#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {60239#false} is VALID [2022-04-08 14:59:18,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {60239#false} assume !false; {60239#false} is VALID [2022-04-08 14:59:18,441 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-08 14:59:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721194992] [2022-04-08 14:59:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721194992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:18,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:18,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123047026] [2022-04-08 14:59:18,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123047026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:18,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942024111] [2022-04-08 14:59:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:18,443 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-08 14:59:18,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:18,443 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-08 14:59:18,470 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-08 14:59:18,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:18,471 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 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-08 14:59:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:19,063 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-08 14:59:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:19,064 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-08 14:59:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:19,064 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-08 14:59:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 14:59:19,065 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-08 14:59:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 14:59:19,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-08 14:59:19,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:19,414 INFO L225 Difference]: With dead ends: 2573 [2022-04-08 14:59:19,414 INFO L226 Difference]: Without dead ends: 2571 [2022-04-08 14:59:19,414 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-08 14:59:19,415 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:19,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-08 14:59:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-08 14:59:19,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:19,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:19,581 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:19,734 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-08 14:59:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-08 14:59:19,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:19,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:19,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-08 14:59:19,739 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-08 14:59:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:19,894 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-08 14:59:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-08 14:59:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:19,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:19,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:19,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-08 14:59:20,120 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-08 14:59:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:20,121 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-08 14:59:20,121 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-08 14:59:20,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 2983 transitions. [2022-04-08 14:59:22,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2983 edges. 2983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-08 14:59:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:59:22,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:22,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:59:22,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:59:22,563 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-08 14:59:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:22,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43516342] [2022-04-08 14:59:22,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-04-08 14:59:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:22,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278392171] [2022-04-08 14:59:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:22,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {75164#true} call ULTIMATE.init(); {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:22,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-08 14:59:22,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {75164#true} call #t~ret13 := main(); {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {75164#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {75164#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {75164#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {75164#true} assume !(0 != ~p1~0); {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {75164#true} assume !(0 != ~p2~0); {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {75164#true} assume !(0 != ~p3~0); {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {75164#true} assume !(0 != ~p4~0); {75164#true} is VALID [2022-04-08 14:59:22,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {75164#true} assume !(0 != ~p5~0); {75164#true} is VALID [2022-04-08 14:59:22,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {75164#true} assume !(0 != ~p6~0); {75164#true} is VALID [2022-04-08 14:59:22,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {75164#true} assume !(0 != ~p7~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 14:59:22,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p7~0; {75165#false} is VALID [2022-04-08 14:59:22,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {75165#false} assume 1 != ~lk7~0; {75165#false} is VALID [2022-04-08 14:59:22,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {75165#false} assume !false; {75165#false} is VALID [2022-04-08 14:59:22,630 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-08 14:59:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278392171] [2022-04-08 14:59:22,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278392171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:22,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:22,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:22,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43516342] [2022-04-08 14:59:22,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43516342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:22,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:22,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138924955] [2022-04-08 14:59:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:22,633 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-08 14:59:22,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:22,633 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-08 14:59:22,644 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-08 14:59:22,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:22,644 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 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-08 14:59:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:24,131 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-08 14:59:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:24,131 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-08 14:59:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:24,131 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-08 14:59:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 14:59:24,132 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-08 14:59:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 14:59:24,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-08 14:59:24,182 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-08 14:59:24,566 INFO L225 Difference]: With dead ends: 5197 [2022-04-08 14:59:24,567 INFO L226 Difference]: Without dead ends: 2955 [2022-04-08 14:59:24,569 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-08 14:59:24,570 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:24,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-08 14:59:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-08 14:59:24,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:24,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:24,781 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:24,782 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:25,008 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-08 14:59:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-08 14:59:25,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:25,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:25,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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 2955 states. [2022-04-08 14:59:25,033 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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 2955 states. [2022-04-08 14:59:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:25,233 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-08 14:59:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-08 14:59:25,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:25,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:25,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:25,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-08 14:59:25,570 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-08 14:59:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:25,570 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-08 14:59:25,570 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-08 14:59:25,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2953 states and 3655 transitions. [2022-04-08 14:59:28,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-08 14:59:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:59:28,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:28,258 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-08 14:59:28,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:59:28,258 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-08 14:59:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:28,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018015229] [2022-04-08 14:59:28,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-04-08 14:59:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:28,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198494808] [2022-04-08 14:59:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:28,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-08 14:59:28,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-08 14:59:28,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-08 14:59:28,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {97386#true} call ULTIMATE.init(); {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:28,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-08 14:59:28,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {97386#true} call #t~ret13 := main(); {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {97386#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {97386#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {97386#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {97386#true} assume !(0 != ~p1~0); {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {97386#true} assume !(0 != ~p2~0); {97386#true} is VALID [2022-04-08 14:59:28,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {97386#true} assume !(0 != ~p3~0); {97386#true} is VALID [2022-04-08 14:59:28,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {97386#true} assume !(0 != ~p4~0); {97386#true} is VALID [2022-04-08 14:59:28,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {97386#true} assume !(0 != ~p5~0); {97386#true} is VALID [2022-04-08 14:59:28,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {97386#true} assume !(0 != ~p6~0); {97386#true} is VALID [2022-04-08 14:59:28,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {97386#true} assume 0 != ~p7~0;~lk7~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {97391#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:59:28,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97387#false} is VALID [2022-04-08 14:59:28,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {97387#false} assume 0 != ~p8~0; {97387#false} is VALID [2022-04-08 14:59:28,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {97387#false} assume 1 != ~lk8~0; {97387#false} is VALID [2022-04-08 14:59:28,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {97387#false} assume !false; {97387#false} is VALID [2022-04-08 14:59:28,306 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-08 14:59:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198494808] [2022-04-08 14:59:28,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198494808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:28,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:28,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:28,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:28,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018015229] [2022-04-08 14:59:28,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018015229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:28,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:28,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306297910] [2022-04-08 14:59:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:28,307 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-08 14:59:28,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:28,308 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-08 14:59:28,322 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-08 14:59:28,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:28,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:28,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:28,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:28,322 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 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-08 14:59:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:29,397 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-08 14:59:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:29,397 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-08 14:59:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:29,399 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-08 14:59:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:59:29,400 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-08 14:59:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:59:29,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 14:59:29,457 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-08 14:59:29,819 INFO L225 Difference]: With dead ends: 4429 [2022-04-08 14:59:29,819 INFO L226 Difference]: Without dead ends: 3019 [2022-04-08 14:59:29,832 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-08 14:59:29,834 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:29,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-08 14:59:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-08 14:59:30,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:30,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:30,038 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:30,040 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:30,256 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-08 14:59:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-08 14:59:30,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:30,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:30,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-08 14:59:30,262 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-08 14:59:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:30,478 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-08 14:59:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-08 14:59:30,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:30,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:30,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:30,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-08 14:59:30,902 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-08 14:59:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:30,902 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-08 14:59:30,902 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-08 14:59:30,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3017 states and 3655 transitions. [2022-04-08 14:59:33,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-08 14:59:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:59:33,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:33,568 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-08 14:59:33,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 14:59:33,568 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-08 14:59:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:33,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649876792] [2022-04-08 14:59:33,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-04-08 14:59:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:33,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612033199] [2022-04-08 14:59:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:33,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:33,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-08 14:59:33,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-08 14:59:33,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {118328#true} call ULTIMATE.init(); {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {118328#true} call #t~ret13 := main(); {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {118328#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {118328#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {118328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {118328#true} is VALID [2022-04-08 14:59:33,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {118328#true} assume !(0 != ~p1~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {118328#true} assume !(0 != ~p2~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {118328#true} assume !(0 != ~p3~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {118328#true} assume !(0 != ~p4~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {118328#true} assume !(0 != ~p5~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {118328#true} assume !(0 != ~p6~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {118328#true} assume !(0 != ~p7~0); {118328#true} is VALID [2022-04-08 14:59:33,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {118328#true} assume 0 != ~p8~0;~lk8~0 := 1; {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {118333#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 14:59:33,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {118333#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118329#false} is VALID [2022-04-08 14:59:33,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {118329#false} assume !false; {118329#false} is VALID [2022-04-08 14:59:33,624 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-08 14:59:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612033199] [2022-04-08 14:59:33,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612033199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:33,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649876792] [2022-04-08 14:59:33,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649876792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307215032] [2022-04-08 14:59:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:33,625 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-08 14:59:33,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:33,625 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-08 14:59:33,647 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-08 14:59:33,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:33,648 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 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-08 14:59:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:35,121 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-08 14:59:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:35,122 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-08 14:59:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:35,122 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-08 14:59:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 14:59:35,123 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-08 14:59:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 14:59:35,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-08 14:59:35,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:36,216 INFO L225 Difference]: With dead ends: 4875 [2022-04-08 14:59:36,216 INFO L226 Difference]: Without dead ends: 4873 [2022-04-08 14:59:36,217 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-08 14:59:36,217 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:36,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-08 14:59:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-08 14:59:36,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:36,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:36,558 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:36,561 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:37,281 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-08 14:59:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-08 14:59:37,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:37,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:37,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-08 14:59:37,293 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-08 14:59:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:37,915 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-08 14:59:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-08 14:59:37,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:37,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:37,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:37,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-08 14:59:38,961 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-08 14:59:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:38,962 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-08 14:59:38,962 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-08 14:59:38,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4617 states and 5447 transitions. [2022-04-08 14:59:43,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5447 edges. 5447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-08 14:59:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:59:43,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:59:43,521 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-08 14:59:43,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 14:59:43,521 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:59:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:59:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-08 14:59:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361844684] [2022-04-08 14:59:43,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:59:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-04-08 14:59:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:59:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190430107] [2022-04-08 14:59:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:59:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:59:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:59:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:59:43,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-08 14:59:43,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-08 14:59:43,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-08 14:59:43,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {147070#true} call ULTIMATE.init(); {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:59:43,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-08 14:59:43,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-08 14:59:43,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-08 14:59:43,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {147070#true} call #t~ret13 := main(); {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {147070#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {147070#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {147070#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {147070#true} assume !(0 != ~p1~0); {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {147070#true} assume !(0 != ~p2~0); {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {147070#true} assume !(0 != ~p3~0); {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {147070#true} assume !(0 != ~p4~0); {147070#true} is VALID [2022-04-08 14:59:43,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {147070#true} assume !(0 != ~p5~0); {147070#true} is VALID [2022-04-08 14:59:43,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {147070#true} assume !(0 != ~p6~0); {147070#true} is VALID [2022-04-08 14:59:43,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {147070#true} assume !(0 != ~p7~0); {147070#true} is VALID [2022-04-08 14:59:43,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {147070#true} assume !(0 != ~p8~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 14:59:43,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {147075#(= main_~p8~0 0)} assume 0 != ~p8~0; {147071#false} is VALID [2022-04-08 14:59:43,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {147071#false} assume 1 != ~lk8~0; {147071#false} is VALID [2022-04-08 14:59:43,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {147071#false} assume !false; {147071#false} is VALID [2022-04-08 14:59:43,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-08 14:59:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:59:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190430107] [2022-04-08 14:59:43,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190430107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:43,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:43,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:43,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:59:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361844684] [2022-04-08 14:59:43,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361844684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:59:43,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:59:43,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:59:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050175084] [2022-04-08 14:59:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:59:43,585 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-08 14:59:43,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:59:43,586 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-08 14:59:43,599 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-08 14:59:43,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:59:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:59:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:59:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:59:43,600 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 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-08 14:59:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:48,748 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-08 14:59:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:48,749 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-08 14:59:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:48,749 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-08 14:59:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:59:48,750 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-08 14:59:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 14:59:48,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 14:59:48,821 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-08 14:59:48,821 INFO L225 Difference]: With dead ends: 10249 [2022-04-08 14:59:48,821 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:59:48,832 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-08 14:59:48,832 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:48,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:59:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:59:48,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:48,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:59:48,833 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:59:48,833 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:59:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:48,833 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:59:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:48,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:48,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:48,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:59:48,834 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 14:59:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:48,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:59:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:48,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:48,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:59:48,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:59:48,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:59:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 14:59:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:59:48,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 14:59:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:59:48,835 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:59:48,835 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-08 14:59:48,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:59:48,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:59:48,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:59:48,837 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:59:48,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 14:59:48,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:59:59,361 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 684 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 15:00:08,129 WARN L232 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 15:00:16,350 WARN L232 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 492 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 15:00:25,161 WARN L232 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 15:01:11,532 WARN L232 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 297 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 15:01:30,800 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 15:01:30,800 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 15:01:30,800 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 15:01:30,800 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,800 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 15:01:30,800 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,800 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,800 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,800 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,801 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 15:01:30,801 INFO L878 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse14 (= main_~lk3~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse13 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse1 (not (= main_~p1~0 0))) (.cse2 (= main_~lk1~0 1)) (.cse10 (= main_~p8~0 0)) (.cse11 (= main_~p7~0 0)) (.cse15 (= main_~lk6~0 1)) (.cse8 (= main_~p3~0 0)) (.cse12 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse15) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse7 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse15 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse15 .cse8 .cse12))) [2022-04-08 15:01:30,801 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-04-08 15:01:30,802 INFO L878 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2022-04-08 15:01:30,802 INFO L878 garLoopResultBuilder]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse0 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse0 .cse6 .cse2 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse7) (and .cse5 .cse8 .cse1 .cse9 .cse4) (and .cse5 .cse8 .cse1 .cse9 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse7) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse1 .cse2 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse6 .cse7))) [2022-04-08 15:01:30,802 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-08 15:01:30,803 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk8~0 1)) (.cse11 (= main_~p7~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse10 (= main_~p8~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse9 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse9))) [2022-04-08 15:01:30,804 INFO L885 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-08 15:01:30,804 INFO L878 garLoopResultBuilder]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 15:01:30,805 INFO L878 garLoopResultBuilder]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~p7~0 0)) (.cse2 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse1 .cse4 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse5))) [2022-04-08 15:01:30,805 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-04-08 15:01:30,805 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-04-08 15:01:30,805 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-08 15:01:30,805 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse6 (= main_~p7~0 0)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse7))) [2022-04-08 15:01:30,805 INFO L878 garLoopResultBuilder]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p4~0 0)) (.cse7 (= main_~p6~0 0)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse9 (= main_~p3~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse7) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse9) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse5) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse6 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse7 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse11 .cse0 .cse1 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse10 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse5 .cse9) (and .cse11 .cse1 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse5 .cse9) (and .cse8 .cse0 .cse6 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse5 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse9) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse0 .cse6 .cse4 .cse5 .cse9) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse1 .cse7 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse9) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse9) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse5) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse0 .cse6 .cse2 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse11 .cse1 .cse4 .cse10 .cse5 .cse9) (and .cse11 .cse6 .cse4 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse7) (and .cse11 .cse6 .cse4 .cse10 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-04-08 15:01:30,805 INFO L878 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-04-08 15:01:30,806 INFO L878 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse11 (= main_~lk7~0 1)) (.cse5 (= main_~p6~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse0 (= main_~p4~0 0)) (.cse7 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse10 (= main_~p5~0 0)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse5 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse12 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse12 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse12 .cse9 .cse6))) [2022-04-08 15:01:30,806 INFO L878 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (not (= main_~p7~0 0)))) (or (and .cse0 (= main_~p8~0 0) .cse1) (and .cse0 (= main_~lk8~0 1) .cse1))) [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse3) (and .cse1 .cse4 .cse5 .cse7) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7) (and .cse2 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse6 .cse7) (and .cse0 .cse4 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse1 .cse4 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse7))) [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 15:01:30,807 INFO L885 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 15:01:30,807 INFO L878 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse7 (= main_~p5~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~lk8~0 1)) (.cse3 (not (= main_~p4~0 0))) (.cse4 (= main_~lk4~0 1)) (.cse8 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse5))) [2022-04-08 15:01:30,808 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-08 15:01:30,808 INFO L878 garLoopResultBuilder]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse4 (= main_~p5~0 0)) (.cse12 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse13 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse6 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse6 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse13) (and .cse8 .cse1 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse0 .cse7 .cse11 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse13 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse13 .cse10) (and .cse11 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse13 .cse12 .cse10) (and .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse13))) [2022-04-08 15:01:30,808 INFO L878 garLoopResultBuilder]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse3 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2022-04-08 15:01:30,810 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:01:30,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:01:30,813 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:01:30,818 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:01:30,959 INFO L163 areAnnotationChecker]: CFG has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 15:01:30,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:01:30 BoogieIcfgContainer [2022-04-08 15:01:30,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:01:30,965 INFO L158 Benchmark]: Toolchain (without parser) took 152126.41ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 164.3MB in the beginning and 1.0GB in the end (delta: -882.9MB). Peak memory consumption was 684.3MB. Max. memory is 8.0GB. [2022-04-08 15:01:30,965 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory was 180.4MB in the beginning and 180.3MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:01:30,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.00ms. Allocated memory is still 218.1MB. Free memory was 164.1MB in the beginning and 189.7MB in the end (delta: -25.6MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-08 15:01:30,965 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 218.1MB. Free memory was 189.7MB in the beginning and 187.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 15:01:30,965 INFO L158 Benchmark]: RCFGBuilder took 294.38ms. Allocated memory is still 218.1MB. Free memory was 187.8MB in the beginning and 174.6MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 15:01:30,965 INFO L158 Benchmark]: TraceAbstraction took 151551.01ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 174.0MB in the beginning and 1.0GB in the end (delta: -873.3MB). Peak memory consumption was 694.4MB. Max. memory is 8.0GB. [2022-04-08 15:01:30,966 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory was 180.4MB in the beginning and 180.3MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.00ms. Allocated memory is still 218.1MB. Free memory was 164.1MB in the beginning and 189.7MB in the end (delta: -25.6MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 218.1MB. Free memory was 189.7MB in the beginning and 187.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 294.38ms. Allocated memory is still 218.1MB. Free memory was 187.8MB in the beginning and 174.6MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 151551.01ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 174.0MB in the beginning and 1.0GB in the end (delta: -873.3MB). Peak memory consumption was 694.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 102.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 57.9s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 43.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 15:01:30,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...