/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:18:58,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:18:58,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:18:59,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:18:59,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:18:59,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:18:59,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:18:59,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:18:59,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:18:59,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:18:59,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:18:59,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:18:59,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:18:59,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:18:59,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:18:59,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:18:59,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:18:59,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:18:59,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:18:59,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:18:59,035 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:18:59,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:18:59,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:18:59,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:18:59,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:18:59,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:18:59,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:18:59,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:18:59,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:18:59,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:18:59,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:18:59,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:18:59,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:18:59,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:18:59,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:18:59,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:18:59,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:18:59,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:18:59,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:18:59,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:18:59,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:18:59,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:18:59,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:18:59,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:18:59,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:18:59,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:18:59,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:18:59,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:18:59,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:59,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:18:59,062 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:18:59,062 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-15 11:18:59,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:18:59,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:18:59,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:18:59,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:18:59,282 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:18:59,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-15 11:18:59,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15c150f/57fd18a5879d40a082fa3d1419e6aacf/FLAG5010999b5 [2022-04-15 11:18:59,671 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:18:59,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-15 11:18:59,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15c150f/57fd18a5879d40a082fa3d1419e6aacf/FLAG5010999b5 [2022-04-15 11:18:59,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd15c150f/57fd18a5879d40a082fa3d1419e6aacf [2022-04-15 11:18:59,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:18:59,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:18:59,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:59,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:18:59,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:18:59,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce091c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59, skipping insertion in model container [2022-04-15 11:18:59,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:18:59,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:18:59,826 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_7.c[2881,2894] [2022-04-15 11:18:59,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:59,834 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:18:59,849 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_7.c[2881,2894] [2022-04-15 11:18:59,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:59,858 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:18:59,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59 WrapperNode [2022-04-15 11:18:59,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:59,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:18:59,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:18:59,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:18:59,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:18:59,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:18:59,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:18:59,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:18:59,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (1/1) ... [2022-04-15 11:18:59,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:59,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:18:59,928 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-15 11:18:59,945 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-15 11:18:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:18:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:18:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:18:59,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:18:59,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:18:59,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:18:59,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:18:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:18:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:18:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:18:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:19:00,012 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:19:00,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:19:00,194 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:19:00,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:19:00,199 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:19:00,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:19:00 BoogieIcfgContainer [2022-04-15 11:19:00,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:19:00,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:19:00,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:19:00,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:19:00,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:18:59" (1/3) ... [2022-04-15 11:19:00,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:19:00, skipping insertion in model container [2022-04-15 11:19:00,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:59" (2/3) ... [2022-04-15 11:19:00,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d7e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:19:00, skipping insertion in model container [2022-04-15 11:19:00,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:19:00" (3/3) ... [2022-04-15 11:19:00,209 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-04-15 11:19:00,212 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:19:00,212 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:19:00,237 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:19:00,247 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-15 11:19:00,247 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:19:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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-15 11:19:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:19:00,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19: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] [2022-04-15 11:19:00,264 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:00,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-04-15 11:19:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:00,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961245107] [2022-04-15 11:19:00,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 2 times [2022-04-15 11:19:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:00,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751879746] [2022-04-15 11:19:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:00,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {39#true} is VALID [2022-04-15 11:19:00,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 11:19:00,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-15 11:19:00,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:00,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {39#true} is VALID [2022-04-15 11:19:00,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 11:19:00,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-15 11:19:00,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2022-04-15 11:19:00,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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;havoc ~cond~0; {39#true} is VALID [2022-04-15 11:19:00,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {39#true} is VALID [2022-04-15 11:19:00,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#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; {39#true} is VALID [2022-04-15 11:19:00,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2022-04-15 11:19:00,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {40#false} is VALID [2022-04-15 11:19:00,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 11:19:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751879746] [2022-04-15 11:19:00,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751879746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:00,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:00,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:00,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:00,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961245107] [2022-04-15 11:19:00,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961245107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:00,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:00,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:00,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565380074] [2022-04-15 11:19:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:00,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 11:19:00,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:00,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:00,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:00,567 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:00,832 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-15 11:19:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:00,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 11:19:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:19:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:19:00,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 11:19:00,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:00,942 INFO L225 Difference]: With dead ends: 70 [2022-04-15 11:19:00,942 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 11:19:00,945 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-15 11:19:00,947 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:00,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:19:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 11:19:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-15 11:19:00,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:00,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,977 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,978 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:00,985 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-15 11:19:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-15 11:19:00,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:00,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:00,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 11:19:00,988 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 11:19:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:00,995 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-15 11:19:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-15 11:19:00,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:00,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:00,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:00,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-15 11:19:01,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-15 11:19:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:01,003 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-15 11:19:01,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 66 transitions. [2022-04-15 11:19:01,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-15 11:19:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:19:01,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:01,091 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:01,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:19:01,092 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-04-15 11:19:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:01,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404661799] [2022-04-15 11:19:01,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 2 times [2022-04-15 11:19:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:01,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159973695] [2022-04-15 11:19:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:01,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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); {379#true} is VALID [2022-04-15 11:19:01,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 11:19:01,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-15 11:19:01,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:01,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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); {379#true} is VALID [2022-04-15 11:19:01,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-15 11:19:01,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-15 11:19:01,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret12 := main(); {379#true} is VALID [2022-04-15 11:19:01,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#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;havoc ~cond~0; {379#true} is VALID [2022-04-15 11:19:01,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {379#true} is VALID [2022-04-15 11:19:01,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#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; {379#true} is VALID [2022-04-15 11:19:01,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#true} assume !(0 != ~p1~0); {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(= main_~p1~0 0)} assume !(0 != ~p2~0); {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-15 11:19:01,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p1~0; {380#false} is VALID [2022-04-15 11:19:01,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#false} assume 1 != ~lk1~0; {380#false} is VALID [2022-04-15 11:19:01,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-15 11:19:01,175 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-15 11:19:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159973695] [2022-04-15 11:19:01,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159973695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:01,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:01,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:01,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404661799] [2022-04-15 11:19:01,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404661799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:01,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:01,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983527171] [2022-04-15 11:19:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:01,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 11:19:01,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:01,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:01,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:01,193 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,340 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-15 11:19:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:01,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 11:19:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 11:19:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-15 11:19:01,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-15 11:19:01,444 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-15 11:19:01,445 INFO L225 Difference]: With dead ends: 88 [2022-04-15 11:19:01,445 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 11:19:01,446 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-15 11:19:01,447 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 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-15 11:19:01,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 11:19:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-15 11:19:01,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:01,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,468 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,468 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,471 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-15 11:19:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-15 11:19:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:01,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:01,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 11:19:01,473 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 11:19:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,477 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-15 11:19:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-15 11:19:01,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:01,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:01,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:01,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-15 11:19:01,484 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-15 11:19:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:01,484 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-15 11:19:01,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 90 transitions. [2022-04-15 11:19:01,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-15 11:19:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:19:01,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:01,560 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-15 11:19:01,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:19:01,560 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-04-15 11:19:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:01,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357165421] [2022-04-15 11:19:01,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 2 times [2022-04-15 11:19:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:01,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135250630] [2022-04-15 11:19:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:01,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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); {783#true} is VALID [2022-04-15 11:19:01,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-15 11:19:01,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-15 11:19:01,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:01,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(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); {783#true} is VALID [2022-04-15 11:19:01,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-15 11:19:01,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-15 11:19:01,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret12 := main(); {783#true} is VALID [2022-04-15 11:19:01,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#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;havoc ~cond~0; {783#true} is VALID [2022-04-15 11:19:01,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {783#true} is VALID [2022-04-15 11:19:01,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#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; {783#true} is VALID [2022-04-15 11:19:01,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume 0 != ~p1~0;~lk1~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:19:01,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {784#false} is VALID [2022-04-15 11:19:01,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#false} assume 0 != ~p2~0; {784#false} is VALID [2022-04-15 11:19:01,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} assume 1 != ~lk2~0; {784#false} is VALID [2022-04-15 11:19:01,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-15 11:19:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:01,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135250630] [2022-04-15 11:19:01,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135250630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:01,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:01,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:01,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:01,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357165421] [2022-04-15 11:19:01,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357165421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:01,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:01,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131114844] [2022-04-15 11:19:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:01,645 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-15 11:19:01,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:01,645 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-15 11:19:01,656 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-15 11:19:01,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:01,657 INFO L87 Difference]: Start difference. First operand 53 states and 90 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-15 11:19:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,784 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-15 11:19:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:01,784 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-15 11:19:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:01,784 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-15 11:19:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:19:01,786 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-15 11:19:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-15 11:19:01,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-15 11:19:01,871 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-15 11:19:01,874 INFO L225 Difference]: With dead ends: 82 [2022-04-15 11:19:01,874 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 11:19:01,875 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-15 11:19:01,878 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 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-15 11:19:01,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 11:19:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-15 11:19:01,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:01,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,892 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,892 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,894 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-15 11:19:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-15 11:19:01,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:01,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:01,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 11:19:01,895 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 11:19:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:01,897 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-15 11:19:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-15 11:19:01,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:01,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:01,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:01,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-15 11:19:01,900 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-15 11:19:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:01,900 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-15 11:19:01,900 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-15 11:19:01,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 92 transitions. [2022-04-15 11:19:01,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-15 11:19:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:19:01,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:01,963 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-15 11:19:01,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:19:01,963 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-04-15 11:19:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216518899] [2022-04-15 11:19:01,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 2 times [2022-04-15 11:19:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602355428] [2022-04-15 11:19:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-15 11:19:02,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-15 11:19:02,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-15 11:19:02,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:02,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-15 11:19:02,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-15 11:19:02,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret12 := main(); {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#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;havoc ~cond~0; {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#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; {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume !(0 != ~p1~0); {1187#true} is VALID [2022-04-15 11:19:02,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume !(0 != ~p2~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-15 11:19:02,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p2~0; {1188#false} is VALID [2022-04-15 11:19:02,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#false} assume 1 != ~lk2~0; {1188#false} is VALID [2022-04-15 11:19:02,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-04-15 11:19:02,009 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-15 11:19:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:02,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602355428] [2022-04-15 11:19:02,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602355428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:02,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216518899] [2022-04-15 11:19:02,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216518899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473037227] [2022-04-15 11:19:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:02,011 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-15 11:19:02,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:02,011 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-15 11:19:02,021 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-15 11:19:02,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:02,022 INFO L87 Difference]: Start difference. First operand 56 states and 92 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-15 11:19:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,126 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-04-15 11:19:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:02,126 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-15 11:19:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:02,127 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-15 11:19:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:19:02,128 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-15 11:19:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-15 11:19:02,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-15 11:19:02,213 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-15 11:19:02,215 INFO L225 Difference]: With dead ends: 148 [2022-04-15 11:19:02,215 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 11:19:02,215 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-15 11:19:02,216 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 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-15 11:19:02,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 11:19:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-15 11:19:02,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:02,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,235 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,235 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,238 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-15 11:19:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-15 11:19:02,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:02,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:02,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 11:19:02,239 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-15 11:19:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,242 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-15 11:19:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-15 11:19:02,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:02,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:02,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:02,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-04-15 11:19:02,245 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-04-15 11:19:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:02,245 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-04-15 11:19:02,245 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-15 11:19:02,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 165 transitions. [2022-04-15 11:19:02,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-04-15 11:19:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:19:02,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:02,362 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-15 11:19:02,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:19:02,362 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-04-15 11:19:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:02,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298817971] [2022-04-15 11:19:02,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 2 times [2022-04-15 11:19:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:02,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727226171] [2022-04-15 11:19:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-15 11:19:02,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-15 11:19:02,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-15 11:19:02,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:02,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-15 11:19:02,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-15 11:19:02,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-15 11:19:02,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret12 := main(); {1895#true} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#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;havoc ~cond~0; {1895#true} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1895#true} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#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; {1895#true} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 != ~p1~0); {1895#true} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume 0 != ~p2~0;~lk2~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1900#(= main_~lk2~0 1)} is VALID [2022-04-15 11:19:02,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1896#false} is VALID [2022-04-15 11:19:02,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-15 11:19:02,418 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-15 11:19:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727226171] [2022-04-15 11:19:02,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727226171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298817971] [2022-04-15 11:19:02,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298817971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958917896] [2022-04-15 11:19:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:02,419 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-15 11:19:02,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:02,419 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-15 11:19:02,429 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-15 11:19:02,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:02,432 INFO L87 Difference]: Start difference. First operand 99 states and 165 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-15 11:19:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,532 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-04-15 11:19:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:02,533 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-15 11:19:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:02,533 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-15 11:19:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:19:02,534 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-15 11:19:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:19:02,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-15 11:19:02,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:02,585 INFO L225 Difference]: With dead ends: 127 [2022-04-15 11:19:02,585 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 11:19:02,586 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-15 11:19:02,586 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 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, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:02,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 11:19:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-04-15 11:19:02,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:02,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,603 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,603 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,606 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-15 11:19:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-15 11:19:02,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:02,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:02,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 11:19:02,607 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 125 states. [2022-04-15 11:19:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,610 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-15 11:19:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-15 11:19:02,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:02,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:02,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:02,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-15 11:19:02,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-15 11:19:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:02,614 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-15 11:19:02,614 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-15 11:19:02,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 163 transitions. [2022-04-15 11:19:02,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-15 11:19:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:19:02,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:02,742 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-15 11:19:02,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:19:02,743 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-04-15 11:19:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:02,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672879043] [2022-04-15 11:19:02,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 2 times [2022-04-15 11:19:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:02,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060665369] [2022-04-15 11:19:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:02,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-15 11:19:02,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-15 11:19:02,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-15 11:19:02,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {2609#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:02,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-15 11:19:02,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-15 11:19:02,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-15 11:19:02,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {2609#true} call #t~ret12 := main(); {2609#true} is VALID [2022-04-15 11:19:02,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {2609#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;havoc ~cond~0; {2609#true} is VALID [2022-04-15 11:19:02,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2609#true} is VALID [2022-04-15 11:19:02,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#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; {2609#true} is VALID [2022-04-15 11:19:02,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#true} assume !(0 != ~p1~0); {2609#true} is VALID [2022-04-15 11:19:02,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#true} assume !(0 != ~p2~0); {2609#true} is VALID [2022-04-15 11:19:02,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {2609#true} assume 0 != ~p3~0;~lk3~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2614#(= main_~lk3~0 1)} is VALID [2022-04-15 11:19:02,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2610#false} is VALID [2022-04-15 11:19:02,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {2610#false} assume !false; {2610#false} is VALID [2022-04-15 11:19:02,810 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-15 11:19:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060665369] [2022-04-15 11:19:02,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060665369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:02,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672879043] [2022-04-15 11:19:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672879043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:02,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:02,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397700749] [2022-04-15 11:19:02,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:02,811 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-15 11:19:02,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:02,811 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-15 11:19:02,822 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-15 11:19:02,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:02,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:02,822 INFO L87 Difference]: Start difference. First operand 99 states and 163 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-15 11:19:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:02,925 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-04-15 11:19:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:02,926 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-15 11:19:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:02,926 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-15 11:19:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 11:19:02,927 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-15 11:19:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 11:19:02,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-15 11:19:02,980 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-15 11:19:02,983 INFO L225 Difference]: With dead ends: 179 [2022-04-15 11:19:02,983 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 11:19:02,983 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-15 11:19:02,985 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 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-15 11:19:02,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 11:19:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-04-15 11:19:03,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:03,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,002 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,002 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,006 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-15 11:19:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-15 11:19:03,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:03,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:03,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 11:19:03,007 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 177 states. [2022-04-15 11:19:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,011 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-15 11:19:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-15 11:19:03,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:03,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:03,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:03,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-04-15 11:19:03,015 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-04-15 11:19:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:03,015 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-04-15 11:19:03,015 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-15 11:19:03,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 221 transitions. [2022-04-15 11:19:03,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-04-15 11:19:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:19:03,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:03,195 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-15 11:19:03,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:19:03,196 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-04-15 11:19:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50747386] [2022-04-15 11:19:03,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 2 times [2022-04-15 11:19:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:03,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788967528] [2022-04-15 11:19:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:03,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-15 11:19:03,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-15 11:19:03,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-15 11:19:03,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {3603#true} call ULTIMATE.init(); {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:03,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-15 11:19:03,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-15 11:19:03,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {3603#true} call #t~ret12 := main(); {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {3603#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;havoc ~cond~0; {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {3603#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#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; {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {3603#true} assume !(0 != ~p1~0); {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {3603#true} assume !(0 != ~p2~0); {3603#true} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {3603#true} assume !(0 != ~p3~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-15 11:19:03,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p3~0; {3604#false} is VALID [2022-04-15 11:19:03,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {3604#false} assume 1 != ~lk3~0; {3604#false} is VALID [2022-04-15 11:19:03,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {3604#false} assume !false; {3604#false} is VALID [2022-04-15 11:19:03,243 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-15 11:19:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:03,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788967528] [2022-04-15 11:19:03,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788967528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:03,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:03,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:03,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:03,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50747386] [2022-04-15 11:19:03,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50747386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:03,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:03,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906891583] [2022-04-15 11:19:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:03,245 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-15 11:19:03,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:03,245 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-15 11:19:03,255 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-15 11:19:03,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:03,256 INFO L87 Difference]: Start difference. First operand 135 states and 221 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-15 11:19:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,364 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-04-15 11:19:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:03,365 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-15 11:19:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:03,365 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-15 11:19:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-15 11:19:03,367 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-15 11:19:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-15 11:19:03,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-15 11:19:03,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:03,453 INFO L225 Difference]: With dead ends: 311 [2022-04-15 11:19:03,453 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 11:19:03,455 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-15 11:19:03,455 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 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-15 11:19:03,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 11:19:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-15 11:19:03,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:03,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,469 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,474 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-15 11:19:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-15 11:19:03,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:03,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:03,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-15 11:19:03,475 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-15 11:19:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,481 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-15 11:19:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-15 11:19:03,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:03,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:03,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:03,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-04-15 11:19:03,495 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-04-15 11:19:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:03,495 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-04-15 11:19:03,495 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-15 11:19:03,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 295 transitions. [2022-04-15 11:19:03,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-04-15 11:19:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:19:03,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:03,758 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-15 11:19:03,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:19:03,758 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-04-15 11:19:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:03,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210891623] [2022-04-15 11:19:03,759 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 2 times [2022-04-15 11:19:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:03,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375217354] [2022-04-15 11:19:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:03,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-15 11:19:03,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 11:19:03,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret12 := main(); {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#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;havoc ~cond~0; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {4973#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; {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {4973#true} assume !(0 != ~p1~0); {4973#true} is VALID [2022-04-15 11:19:03,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {4973#true} assume !(0 != ~p2~0); {4973#true} is VALID [2022-04-15 11:19:03,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {4973#true} assume 0 != ~p3~0;~lk3~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:19:03,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4974#false} is VALID [2022-04-15 11:19:03,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {4974#false} assume 0 != ~p4~0; {4974#false} is VALID [2022-04-15 11:19:03,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {4974#false} assume 1 != ~lk4~0; {4974#false} is VALID [2022-04-15 11:19:03,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-15 11:19:03,787 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-15 11:19:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375217354] [2022-04-15 11:19:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375217354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:03,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:03,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:03,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210891623] [2022-04-15 11:19:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210891623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:03,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:03,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886957359] [2022-04-15 11:19:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:03,788 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-15 11:19:03,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:03,788 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-15 11:19:03,799 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-15 11:19:03,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:03,799 INFO L87 Difference]: Start difference. First operand 183 states and 295 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-15 11:19:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:03,908 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-04-15 11:19:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:03,908 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-15 11:19:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:03,909 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-15 11:19:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:19:03,911 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-15 11:19:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-15 11:19:03,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-15 11:19:03,986 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-15 11:19:03,989 INFO L225 Difference]: With dead ends: 277 [2022-04-15 11:19:03,989 INFO L226 Difference]: Without dead ends: 191 [2022-04-15 11:19:03,991 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-15 11:19:03,991 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:03,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-15 11:19:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-15 11:19:04,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:04,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,008 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,010 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:04,012 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-15 11:19:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-15 11:19:04,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:04,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:04,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-15 11:19:04,013 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 191 states. [2022-04-15 11:19:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:04,016 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-15 11:19:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-15 11:19:04,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:04,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:04,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:04,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-04-15 11:19:04,019 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-04-15 11:19:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:04,020 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-04-15 11:19:04,020 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-15 11:19:04,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 299 transitions. [2022-04-15 11:19:04,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-04-15 11:19:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:19:04,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:04,280 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-15 11:19:04,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:19:04,280 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-04-15 11:19:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:04,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687460617] [2022-04-15 11:19:04,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 2 times [2022-04-15 11:19:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:04,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682614016] [2022-04-15 11:19:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:04,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-15 11:19:04,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-15 11:19:04,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret12 := main(); {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {6299#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;havoc ~cond~0; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {6299#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#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; {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#true} assume !(0 != ~p1~0); {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#true} assume !(0 != ~p2~0); {6299#true} is VALID [2022-04-15 11:19:04,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {6299#true} assume !(0 != ~p3~0); {6299#true} is VALID [2022-04-15 11:19:04,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#true} assume 0 != ~p4~0;~lk4~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6304#(= main_~lk4~0 1)} is VALID [2022-04-15 11:19:04,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {6304#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6300#false} is VALID [2022-04-15 11:19:04,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2022-04-15 11:19:04,324 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-15 11:19:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682614016] [2022-04-15 11:19:04,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682614016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:04,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:04,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:04,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687460617] [2022-04-15 11:19:04,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687460617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:04,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:04,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593406286] [2022-04-15 11:19:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:04,325 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-15 11:19:04,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:04,325 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-15 11:19:04,337 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-15 11:19:04,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:04,338 INFO L87 Difference]: Start difference. First operand 189 states and 299 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-15 11:19:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:04,458 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-04-15 11:19:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:04,459 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-15 11:19:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:04,459 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-15 11:19:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 11:19:04,460 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-15 11:19:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-15 11:19:04,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-15 11:19:04,509 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-15 11:19:04,514 INFO L225 Difference]: With dead ends: 333 [2022-04-15 11:19:04,515 INFO L226 Difference]: Without dead ends: 331 [2022-04-15 11:19:04,515 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-15 11:19:04,515 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 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-15 11:19:04,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-15 11:19:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-15 11:19:04,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:04,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,564 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,565 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:04,571 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-15 11:19:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-15 11:19:04,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:04,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:04,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-15 11:19:04,583 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-15 11:19:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:04,589 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-15 11:19:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-15 11:19:04,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:04,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:04,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:04,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-04-15 11:19:04,595 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-04-15 11:19:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:04,595 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-04-15 11:19:04,595 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-15 11:19:04,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 411 transitions. [2022-04-15 11:19:04,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-04-15 11:19:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:19:04,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:04,949 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:04,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:19:04,949 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-04-15 11:19:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824757284] [2022-04-15 11:19:04,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 2 times [2022-04-15 11:19:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851036436] [2022-04-15 11:19:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:04,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-15 11:19:04,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-15 11:19:04,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-15 11:19:04,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:04,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-15 11:19:04,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret12 := main(); {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#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;havoc ~cond~0; {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {8169#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {8169#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; {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {8169#true} assume !(0 != ~p1~0); {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {8169#true} assume !(0 != ~p2~0); {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {8169#true} assume !(0 != ~p3~0); {8169#true} is VALID [2022-04-15 11:19:04,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {8169#true} assume !(0 != ~p4~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-15 11:19:04,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p4~0; {8170#false} is VALID [2022-04-15 11:19:04,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume 1 != ~lk4~0; {8170#false} is VALID [2022-04-15 11:19:04,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-15 11:19:04,994 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-15 11:19:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851036436] [2022-04-15 11:19:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851036436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:04,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:04,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:04,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824757284] [2022-04-15 11:19:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824757284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:04,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:04,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614835043] [2022-04-15 11:19:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:04,995 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-15 11:19:04,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:04,996 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-15 11:19:05,006 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-15 11:19:05,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:05,007 INFO L87 Difference]: Start difference. First operand 265 states and 411 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-15 11:19:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:05,136 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-04-15 11:19:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:05,136 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-15 11:19:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:05,136 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-15 11:19:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-15 11:19:05,138 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-15 11:19:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-15 11:19:05,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-15 11:19:05,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:05,234 INFO L225 Difference]: With dead ends: 605 [2022-04-15 11:19:05,234 INFO L226 Difference]: Without dead ends: 355 [2022-04-15 11:19:05,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:05,235 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:05,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-15 11:19:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-15 11:19:05,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:05,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:05,253 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:05,254 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:05,260 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-15 11:19:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-15 11:19:05,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:05,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:05,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-15 11:19:05,261 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 355 states. [2022-04-15 11:19:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:05,267 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-15 11:19:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-15 11:19:05,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:05,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:05,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:05,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-04-15 11:19:05,276 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-04-15 11:19:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:05,276 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-04-15 11:19:05,276 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-15 11:19:05,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 535 transitions. [2022-04-15 11:19:05,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-04-15 11:19:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:05,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:05,723 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-15 11:19:05,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:19:05,723 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-04-15 11:19:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:05,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689149440] [2022-04-15 11:19:05,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 2 times [2022-04-15 11:19:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702844604] [2022-04-15 11:19:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:05,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-15 11:19:05,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-15 11:19:05,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-15 11:19:05,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:05,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-15 11:19:05,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret12 := main(); {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#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;havoc ~cond~0; {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#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; {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !(0 != ~p1~0); {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {10807#true} assume !(0 != ~p2~0); {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {10807#true} assume !(0 != ~p3~0); {10807#true} is VALID [2022-04-15 11:19:05,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {10807#true} assume 0 != ~p4~0;~lk4~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:19:05,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10808#false} is VALID [2022-04-15 11:19:05,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {10808#false} assume 0 != ~p5~0; {10808#false} is VALID [2022-04-15 11:19:05,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {10808#false} assume 1 != ~lk5~0; {10808#false} is VALID [2022-04-15 11:19:05,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-15 11:19:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:19:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702844604] [2022-04-15 11:19:05,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702844604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:05,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:05,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:05,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689149440] [2022-04-15 11:19:05,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689149440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:05,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:05,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356253482] [2022-04-15 11:19:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:05,790 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-15 11:19:05,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:05,790 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-15 11:19:05,801 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-15 11:19:05,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:05,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:05,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:05,802 INFO L87 Difference]: Start difference. First operand 353 states and 535 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-15 11:19:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:05,914 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-04-15 11:19:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:05,914 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-15 11:19:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:05,915 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-15 11:19:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 11:19:05,916 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-15 11:19:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-15 11:19:05,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-15 11:19:05,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:05,995 INFO L225 Difference]: With dead ends: 529 [2022-04-15 11:19:05,995 INFO L226 Difference]: Without dead ends: 363 [2022-04-15 11:19:05,995 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-15 11:19:05,996 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:05,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-15 11:19:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-15 11:19:06,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:06,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,015 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,015 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:06,021 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-15 11:19:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-15 11:19:06,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:06,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:06,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-15 11:19:06,022 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 363 states. [2022-04-15 11:19:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:06,028 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-15 11:19:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-15 11:19:06,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:06,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:06,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:06,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-04-15 11:19:06,045 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-04-15 11:19:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:06,045 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-04-15 11:19:06,046 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-15 11:19:06,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 535 transitions. [2022-04-15 11:19:06,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-04-15 11:19:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:06,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:06,485 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-15 11:19:06,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:19:06,485 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-04-15 11:19:06,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:06,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181102547] [2022-04-15 11:19:06,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 2 times [2022-04-15 11:19:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619256232] [2022-04-15 11:19:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:06,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-15 11:19:06,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-15 11:19:06,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-15 11:19:06,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {13325#true} call ULTIMATE.init(); {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:06,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-15 11:19:06,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-15 11:19:06,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-15 11:19:06,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {13325#true} call #t~ret12 := main(); {13325#true} is VALID [2022-04-15 11:19:06,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {13325#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;havoc ~cond~0; {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {13325#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {13325#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; {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {13325#true} assume !(0 != ~p1~0); {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {13325#true} assume !(0 != ~p2~0); {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {13325#true} assume !(0 != ~p3~0); {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {13325#true} assume !(0 != ~p4~0); {13325#true} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {13325#true} assume 0 != ~p5~0;~lk5~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p5~0; {13330#(= main_~lk5~0 1)} is VALID [2022-04-15 11:19:06,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {13330#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {13326#false} is VALID [2022-04-15 11:19:06,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {13326#false} assume !false; {13326#false} is VALID [2022-04-15 11:19:06,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-15 11:19:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619256232] [2022-04-15 11:19:06,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619256232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:06,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:06,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181102547] [2022-04-15 11:19:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181102547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822122511] [2022-04-15 11:19:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:06,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-15 11:19:06,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:06,544 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-15 11:19:06,555 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-15 11:19:06,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:06,556 INFO L87 Difference]: Start difference. First operand 361 states and 535 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-15 11:19:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:06,691 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-04-15 11:19:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:06,691 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-15 11:19:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:06,691 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-15 11:19:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-15 11:19:06,692 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-15 11:19:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-15 11:19:06,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-15 11:19:06,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:06,769 INFO L225 Difference]: With dead ends: 621 [2022-04-15 11:19:06,770 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 11:19:06,770 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-15 11:19:06,771 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:06,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 11:19:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-15 11:19:06,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:06,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,799 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,800 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:06,814 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-15 11:19:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-15 11:19:06,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:06,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:06,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:19:06,817 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:19:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:06,832 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-15 11:19:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-15 11:19:06,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:06,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:06,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:06,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-04-15 11:19:06,847 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-04-15 11:19:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:06,847 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-04-15 11:19:06,847 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-15 11:19:06,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 751 transitions. [2022-04-15 11:19:07,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-04-15 11:19:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:19:07,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:07,544 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-15 11:19:07,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:19:07,545 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-04-15 11:19:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:07,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780442436] [2022-04-15 11:19:07,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 2 times [2022-04-15 11:19:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:07,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856699562] [2022-04-15 11:19:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:07,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:07,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-15 11:19:07,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-15 11:19:07,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-15 11:19:07,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {16859#true} call ULTIMATE.init(); {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {16859#true} call #t~ret12 := main(); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {16859#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;havoc ~cond~0; {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {16859#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {16859#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; {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {16859#true} assume !(0 != ~p1~0); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#true} assume !(0 != ~p2~0); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {16859#true} assume !(0 != ~p3~0); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {16859#true} assume !(0 != ~p4~0); {16859#true} is VALID [2022-04-15 11:19:07,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#true} assume !(0 != ~p5~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p1~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p2~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p3~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p4~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-15 11:19:07,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p5~0; {16860#false} is VALID [2022-04-15 11:19:07,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {16860#false} assume 1 != ~lk5~0; {16860#false} is VALID [2022-04-15 11:19:07,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {16860#false} assume !false; {16860#false} is VALID [2022-04-15 11:19:07,587 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-15 11:19:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856699562] [2022-04-15 11:19:07,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856699562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:07,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:07,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:07,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780442436] [2022-04-15 11:19:07,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780442436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:07,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:07,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564237833] [2022-04-15 11:19:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:07,589 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-15 11:19:07,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:07,589 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-15 11:19:07,599 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-15 11:19:07,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:07,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:07,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:07,600 INFO L87 Difference]: Start difference. First operand 521 states and 751 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-15 11:19:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:07,775 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-04-15 11:19:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:07,775 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-15 11:19:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:07,776 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-15 11:19:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-15 11:19:07,777 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-15 11:19:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-15 11:19:07,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-15 11:19:07,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:07,892 INFO L225 Difference]: With dead ends: 1181 [2022-04-15 11:19:07,892 INFO L226 Difference]: Without dead ends: 683 [2022-04-15 11:19:07,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:07,895 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:07,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-15 11:19:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-15 11:19:07,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:07,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:07,942 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:07,944 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:07,960 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-15 11:19:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-15 11:19:07,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:07,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:07,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-15 11:19:07,962 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 683 states. [2022-04-15 11:19:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:07,979 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-15 11:19:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-15 11:19:07,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:07,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:07,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:07,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-04-15 11:19:08,002 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-04-15 11:19:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:08,002 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-04-15 11:19:08,005 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-15 11:19:08,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 951 transitions. [2022-04-15 11:19:08,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-04-15 11:19:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:08,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:08,891 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-15 11:19:08,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:19:08,891 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-04-15 11:19:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:08,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980601260] [2022-04-15 11:19:08,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 2 times [2022-04-15 11:19:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690109270] [2022-04-15 11:19:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:08,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-15 11:19:08,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-15 11:19:08,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {21961#true} call ULTIMATE.init(); {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {21961#true} call #t~ret12 := main(); {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {21961#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;havoc ~cond~0; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {21961#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {21961#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; {21961#true} is VALID [2022-04-15 11:19:08,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {21961#true} assume !(0 != ~p1~0); {21961#true} is VALID [2022-04-15 11:19:08,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {21961#true} assume !(0 != ~p2~0); {21961#true} is VALID [2022-04-15 11:19:08,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {21961#true} assume !(0 != ~p3~0); {21961#true} is VALID [2022-04-15 11:19:08,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {21961#true} assume !(0 != ~p4~0); {21961#true} is VALID [2022-04-15 11:19:08,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {21961#true} assume 0 != ~p5~0;~lk5~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-15 11:19:08,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {21962#false} is VALID [2022-04-15 11:19:08,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {21962#false} assume 0 != ~p6~0; {21962#false} is VALID [2022-04-15 11:19:08,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {21962#false} assume 1 != ~lk6~0; {21962#false} is VALID [2022-04-15 11:19:08,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {21962#false} assume !false; {21962#false} is VALID [2022-04-15 11:19:08,947 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-15 11:19:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:08,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690109270] [2022-04-15 11:19:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690109270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:08,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:08,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:08,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980601260] [2022-04-15 11:19:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980601260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:08,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:08,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937260124] [2022-04-15 11:19:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:08,949 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-15 11:19:08,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:08,949 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-15 11:19:08,962 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-15 11:19:08,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:08,963 INFO L87 Difference]: Start difference. First operand 681 states and 951 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-15 11:19:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:09,167 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-04-15 11:19:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:09,167 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-15 11:19:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:09,167 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-15 11:19:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-15 11:19:09,169 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-15 11:19:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-15 11:19:09,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-15 11:19:09,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:09,257 INFO L225 Difference]: With dead ends: 1021 [2022-04-15 11:19:09,257 INFO L226 Difference]: Without dead ends: 699 [2022-04-15 11:19:09,258 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-15 11:19:09,258 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:09,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-15 11:19:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-15 11:19:09,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:09,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:09,299 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:09,300 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:09,318 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-15 11:19:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-15 11:19:09,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:09,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:09,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-15 11:19:09,320 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-15 11:19:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:09,336 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-15 11:19:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-15 11:19:09,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:09,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:09,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:09,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-04-15 11:19:09,388 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-04-15 11:19:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:09,388 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-04-15 11:19:09,388 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-15 11:19:09,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 951 transitions. [2022-04-15 11:19:10,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-04-15 11:19:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:10,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:10,265 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-15 11:19:10,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:19:10,266 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-04-15 11:19:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:10,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788839176] [2022-04-15 11:19:10,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 2 times [2022-04-15 11:19:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:10,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601275779] [2022-04-15 11:19:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:10,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-15 11:19:10,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-15 11:19:10,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-15 11:19:10,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {26807#true} call ULTIMATE.init(); {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-15 11:19:10,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {26807#true} call #t~ret12 := main(); {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {26807#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;havoc ~cond~0; {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {26807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {26807#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; {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {26807#true} assume !(0 != ~p1~0); {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {26807#true} assume !(0 != ~p2~0); {26807#true} is VALID [2022-04-15 11:19:10,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {26807#true} assume !(0 != ~p3~0); {26807#true} is VALID [2022-04-15 11:19:10,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {26807#true} assume !(0 != ~p4~0); {26807#true} is VALID [2022-04-15 11:19:10,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {26807#true} assume !(0 != ~p5~0); {26807#true} is VALID [2022-04-15 11:19:10,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {26807#true} assume 0 != ~p6~0;~lk6~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p6~0; {26812#(= main_~lk6~0 1)} is VALID [2022-04-15 11:19:10,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {26812#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {26808#false} is VALID [2022-04-15 11:19:10,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {26808#false} assume !false; {26808#false} is VALID [2022-04-15 11:19:10,318 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-15 11:19:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601275779] [2022-04-15 11:19:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601275779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:10,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:10,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:10,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788839176] [2022-04-15 11:19:10,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788839176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:10,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:10,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:10,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631990934] [2022-04-15 11:19:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:10,320 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-15 11:19:10,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:10,320 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-15 11:19:10,332 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-15 11:19:10,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:10,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:10,333 INFO L87 Difference]: Start difference. First operand 697 states and 951 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-15 11:19:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:10,544 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-04-15 11:19:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:10,545 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-15 11:19:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:10,545 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-15 11:19:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 11:19:10,546 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-15 11:19:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 11:19:10,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-15 11:19:10,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:10,642 INFO L225 Difference]: With dead ends: 1165 [2022-04-15 11:19:10,642 INFO L226 Difference]: Without dead ends: 1163 [2022-04-15 11:19:10,644 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-15 11:19:10,645 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:10,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-15 11:19:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-04-15 11:19:10,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:10,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,719 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,720 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:10,759 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-15 11:19:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-15 11:19:10,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:10,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:10,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-15 11:19:10,763 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1163 states. [2022-04-15 11:19:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:10,802 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-15 11:19:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-15 11:19:10,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:10,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:10,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:10,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-04-15 11:19:10,854 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-04-15 11:19:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:10,854 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-04-15 11:19:10,854 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-15 11:19:10,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1367 transitions. [2022-04-15 11:19:12,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1367 edges. 1367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-04-15 11:19:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 11:19:12,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:12,127 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:19:12,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:19:12,128 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-04-15 11:19:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:12,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109557724] [2022-04-15 11:19:12,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 2 times [2022-04-15 11:19:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:12,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401219034] [2022-04-15 11:19:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:12,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-15 11:19:12,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-15 11:19:12,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {33541#true} call ULTIMATE.init(); {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:12,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {33541#true} call #t~ret12 := main(); {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {33541#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;havoc ~cond~0; {33541#true} is VALID [2022-04-15 11:19:12,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {33541#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {33541#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; {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {33541#true} assume !(0 != ~p1~0); {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {33541#true} assume !(0 != ~p2~0); {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {33541#true} assume !(0 != ~p3~0); {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {33541#true} assume !(0 != ~p4~0); {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {33541#true} assume !(0 != ~p5~0); {33541#true} is VALID [2022-04-15 11:19:12,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {33541#true} assume !(0 != ~p6~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p1~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p2~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p3~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p4~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p5~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-15 11:19:12,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p6~0; {33542#false} is VALID [2022-04-15 11:19:12,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {33542#false} assume 1 != ~lk6~0; {33542#false} is VALID [2022-04-15 11:19:12,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {33542#false} assume !false; {33542#false} is VALID [2022-04-15 11:19:12,184 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-15 11:19:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401219034] [2022-04-15 11:19:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401219034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:12,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:12,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:12,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109557724] [2022-04-15 11:19:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109557724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:12,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:12,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438970992] [2022-04-15 11:19:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:12,185 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-15 11:19:12,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:12,185 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-15 11:19:12,203 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-15 11:19:12,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:12,204 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 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-15 11:19:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:12,619 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-04-15 11:19:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:12,620 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-15 11:19:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:12,620 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-15 11:19:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:19:12,621 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-15 11:19:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-15 11:19:12,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-15 11:19:12,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:12,762 INFO L225 Difference]: With dead ends: 2317 [2022-04-15 11:19:12,762 INFO L226 Difference]: Without dead ends: 1323 [2022-04-15 11:19:12,764 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-15 11:19:12,764 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:12,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-15 11:19:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-15 11:19:12,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:12,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:12,849 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:12,850 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:12,912 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-15 11:19:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-15 11:19:12,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:12,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:12,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-15 11:19:12,917 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1323 states. [2022-04-15 11:19:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:12,974 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-15 11:19:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-15 11:19:12,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:12,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:12,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:12,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-04-15 11:19:13,057 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-04-15 11:19:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:13,058 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-04-15 11:19:13,058 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-15 11:19:13,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1321 states and 1671 transitions. [2022-04-15 11:19:14,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-04-15 11:19:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:14,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:14,582 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-15 11:19:14,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:19:14,582 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-04-15 11:19:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590214276] [2022-04-15 11:19:14,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 2 times [2022-04-15 11:19:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169157290] [2022-04-15 11:19:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:14,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-15 11:19:14,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-15 11:19:14,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {43475#true} call ULTIMATE.init(); {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:14,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {43475#true} call #t~ret12 := main(); {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {43475#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;havoc ~cond~0; {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {43475#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {43475#true} is VALID [2022-04-15 11:19:14,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#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; {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#true} assume !(0 != ~p1~0); {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {43475#true} assume !(0 != ~p2~0); {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {43475#true} assume !(0 != ~p3~0); {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {43475#true} assume !(0 != ~p4~0); {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {43475#true} assume !(0 != ~p5~0); {43475#true} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {43475#true} assume 0 != ~p6~0;~lk6~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {43480#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-15 11:19:14,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {43476#false} is VALID [2022-04-15 11:19:14,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {43476#false} assume 0 != ~p7~0; {43476#false} is VALID [2022-04-15 11:19:14,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {43476#false} assume 1 != ~lk7~0; {43476#false} is VALID [2022-04-15 11:19:14,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {43476#false} assume !false; {43476#false} is VALID [2022-04-15 11:19:14,648 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-15 11:19:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:14,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169157290] [2022-04-15 11:19:14,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169157290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:14,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:14,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:14,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:14,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590214276] [2022-04-15 11:19:14,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590214276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:14,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:14,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517166915] [2022-04-15 11:19:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:14,649 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-15 11:19:14,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:14,649 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-15 11:19:14,663 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-15 11:19:14,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:14,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:14,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:14,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:14,663 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 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-15 11:19:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:15,019 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-04-15 11:19:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:15,019 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-15 11:19:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:15,020 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-15 11:19:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:19:15,021 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-15 11:19:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:19:15,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-15 11:19:15,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:15,160 INFO L225 Difference]: With dead ends: 1981 [2022-04-15 11:19:15,160 INFO L226 Difference]: Without dead ends: 1355 [2022-04-15 11:19:15,161 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-15 11:19:15,163 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:15,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-15 11:19:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-15 11:19:15,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:15,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:15,249 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:15,249 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:15,300 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-15 11:19:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-15 11:19:15,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:15,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:15,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states 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-15 11:19:15,304 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states 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-15 11:19:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:15,352 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-15 11:19:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-15 11:19:15,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:15,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:15,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:15,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-04-15 11:19:15,426 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-04-15 11:19:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:15,426 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-04-15 11:19:15,426 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-15 11:19:15,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 1671 transitions. [2022-04-15 11:19:16,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-04-15 11:19:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:16,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:16,941 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-15 11:19:16,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:19:16,941 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-04-15 11:19:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:16,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088185279] [2022-04-15 11:19:16,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 2 times [2022-04-15 11:19:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:16,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105966481] [2022-04-15 11:19:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:16,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {52865#true} call ULTIMATE.init(); {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:16,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-15 11:19:16,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {52865#true} call #t~ret12 := main(); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {52865#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;havoc ~cond~0; {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {52865#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {52865#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; {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {52865#true} assume !(0 != ~p1~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {52865#true} assume !(0 != ~p2~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {52865#true} assume !(0 != ~p3~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {52865#true} assume !(0 != ~p4~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {52865#true} assume !(0 != ~p5~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {52865#true} assume !(0 != ~p6~0); {52865#true} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {52865#true} assume 0 != ~p7~0;~lk7~0 := 1; {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {52870#(= main_~lk7~0 1)} assume 0 != ~p7~0; {52870#(= main_~lk7~0 1)} is VALID [2022-04-15 11:19:16,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {52870#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {52866#false} is VALID [2022-04-15 11:19:16,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {52866#false} assume !false; {52866#false} is VALID [2022-04-15 11:19:16,978 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-15 11:19:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105966481] [2022-04-15 11:19:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105966481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:16,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:16,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:16,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:16,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088185279] [2022-04-15 11:19:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088185279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:16,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:16,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443285582] [2022-04-15 11:19:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:16,980 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-15 11:19:16,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:16,980 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-15 11:19:16,992 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-15 11:19:16,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:16,993 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 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-15 11:19:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:17,451 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-04-15 11:19:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:17,451 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-15 11:19:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:17,452 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-15 11:19:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 11:19:17,453 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-15 11:19:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 11:19:17,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-15 11:19:17,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:17,697 INFO L225 Difference]: With dead ends: 2187 [2022-04-15 11:19:17,698 INFO L226 Difference]: Without dead ends: 2185 [2022-04-15 11:19:17,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:19:17,698 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:17,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-04-15 11:19:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-04-15 11:19:17,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:17,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:17,837 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:17,839 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:17,983 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-15 11:19:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-15 11:19:17,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:17,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:17,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2185 states. [2022-04-15 11:19:17,989 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2185 states. [2022-04-15 11:19:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:18,120 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-15 11:19:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-15 11:19:18,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:18,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:18,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:18,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:19:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-04-15 11:19:18,345 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-04-15 11:19:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:18,345 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-04-15 11:19:18,345 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-15 11:19:18,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 2471 transitions. [2022-04-15 11:19:20,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2471 edges. 2471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-04-15 11:19:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 11:19:20,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:19:20,705 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-15 11:19:20,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:19:20,705 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:19:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:19:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-04-15 11:19:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900915952] [2022-04-15 11:19:20,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:19:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 2 times [2022-04-15 11:19:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:19:20,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086989485] [2022-04-15 11:19:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:19:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:19:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:19:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:19:20,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-15 11:19:20,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-15 11:19:20,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-15 11:19:20,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {65735#true} call ULTIMATE.init(); {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:19:20,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-15 11:19:20,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-15 11:19:20,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {65735#true} call #t~ret12 := main(); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {65735#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;havoc ~cond~0; {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {65735#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {65735#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; {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {65735#true} assume !(0 != ~p1~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {65735#true} assume !(0 != ~p2~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {65735#true} assume !(0 != ~p3~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {65735#true} assume !(0 != ~p4~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {65735#true} assume !(0 != ~p5~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {65735#true} assume !(0 != ~p6~0); {65735#true} is VALID [2022-04-15 11:19:20,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {65735#true} assume !(0 != ~p7~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p1~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p2~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p3~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p4~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p5~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p6~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-15 11:19:20,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {65740#(= main_~p7~0 0)} assume 0 != ~p7~0; {65736#false} is VALID [2022-04-15 11:19:20,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {65736#false} assume 1 != ~lk7~0; {65736#false} is VALID [2022-04-15 11:19:20,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {65736#false} assume !false; {65736#false} is VALID [2022-04-15 11:19:20,757 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-15 11:19:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:19:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086989485] [2022-04-15 11:19:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086989485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:20,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:19:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900915952] [2022-04-15 11:19:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900915952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:19:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:19:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:19:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155937706] [2022-04-15 11:19:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:19:20,759 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-15 11:19:20,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:19:20,759 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-15 11:19:20,773 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-15 11:19:20,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:19:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:19:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:19:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:19:20,774 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 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-15 11:19:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:21,966 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-04-15 11:19:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:19:21,967 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-15 11:19:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:19:21,967 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-15 11:19:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:19:21,968 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-15 11:19:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:19:21,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-15 11:19:22,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:19:22,040 INFO L225 Difference]: With dead ends: 4553 [2022-04-15 11:19:22,040 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:19:22,045 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-15 11:19:22,045 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:19:22,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:19:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:19:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:19:22,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:19:22,046 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-15 11:19:22,046 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-15 11:19:22,046 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-15 11:19:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:22,046 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:19:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:19:22,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:22,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:22,046 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-15 11:19:22,046 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-15 11:19:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:19:22,046 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:19:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:19:22,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:22,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:19:22,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:19:22,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:19:22,047 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-15 11:19:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:19:22,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-15 11:19:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:19:22,048 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:19:22,048 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-15 11:19:22,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:19:22,048 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-15 11:19:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:19:22,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:19:22,050 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:19:22,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:19:22,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:19:51,699 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 11:19:51,699 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 11:19:51,699 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 11:19:51,699 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,699 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-15 11:19:51,699 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,699 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,699 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,699 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:19:51,700 INFO L878 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-04-15 11:19:51,700 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-04-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L77-1(lines 32 118) 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-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 32 118) 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-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-04-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L61-1(lines 32 118) 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-15 11:19:51,701 INFO L885 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-15 11:19:51,701 INFO L885 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-04-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-15 11:19:51,701 INFO L878 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-04-15 11:19:51,702 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-04-15 11:19:51,702 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-04-15 11:19:51,702 INFO L885 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-04-15 11:19:51,702 INFO L878 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L73-1(lines 32 118) 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-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-04-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 32 118) 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-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L57-1(lines 32 118) 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-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-04-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-04-15 11:19:51,703 INFO L878 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-04-15 11:19:51,703 INFO L885 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-04-15 11:19:51,704 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-04-15 11:19:51,704 INFO L878 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-04-15 11:19:51,706 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] [2022-04-15 11:19:51,707 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:19:51,709 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:19:51,710 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:19:51,763 INFO L163 areAnnotationChecker]: CFG has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 11:19:51,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:19:51 BoogieIcfgContainer [2022-04-15 11:19:51,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:19:51,769 INFO L158 Benchmark]: Toolchain (without parser) took 52082.12ms. Allocated memory was 197.1MB in the beginning and 594.5MB in the end (delta: 397.4MB). Free memory was 149.1MB in the beginning and 348.9MB in the end (delta: -199.8MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. [2022-04-15 11:19:51,769 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:19:51,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.13ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 172.8MB in the end (delta: -24.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-15 11:19:51,769 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 11:19:51,769 INFO L158 Benchmark]: RCFGBuilder took 315.41ms. Allocated memory is still 197.1MB. Free memory was 171.3MB in the beginning and 158.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:19:51,769 INFO L158 Benchmark]: TraceAbstraction took 51566.63ms. Allocated memory was 197.1MB in the beginning and 594.5MB in the end (delta: 397.4MB). Free memory was 158.2MB in the beginning and 348.9MB in the end (delta: -190.7MB). Peak memory consumption was 353.2MB. Max. memory is 8.0GB. [2022-04-15 11:19:51,770 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.09ms. Allocated memory is still 197.1MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.13ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 172.8MB in the end (delta: -24.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 315.41ms. Allocated memory is still 197.1MB. Free memory was 171.3MB in the beginning and 158.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 51566.63ms. Allocated memory was 197.1MB in the beginning and 594.5MB in the end (delta: 397.4MB). Free memory was 158.2MB in the beginning and 348.9MB in the end (delta: -190.7MB). Peak memory consumption was 353.2MB. 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: 121]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 12.2s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 17.4s 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 11:19:51,793 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...