/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:19:07,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:19:07,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:19:07,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:19:07,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:19:07,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:19:07,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:19:07,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:19:07,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:19:07,377 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:19:07,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:19:07,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:19:07,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:19:07,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:19:07,379 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:19:07,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:19:07,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:19:07,380 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:19:07,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:19:07,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:19:07,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:19:07,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:19:07,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:19:07,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:19:07,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:19:07,389 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:19:07,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:19:07,389 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:19:07,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:19:07,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:19:07,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:19:07,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:19:07,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:19:07,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:19:07,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:19:07,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:19:07,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:19:07,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:19:07,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:19:07,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:19:07,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:19:07,656 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:19:07,657 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:19:07,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2023-12-16 03:19:08,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:19:09,087 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:19:09,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2023-12-16 03:19:09,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca49c8119/71ac837e01314f98a907823f13625d4e/FLAGa451bfe58 [2023-12-16 03:19:09,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca49c8119/71ac837e01314f98a907823f13625d4e [2023-12-16 03:19:09,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:19:09,120 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:19:09,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:19:09,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:19:09,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:19:09,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478ad13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09, skipping insertion in model container [2023-12-16 03:19:09,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:19:09,306 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i[919,932] [2023-12-16 03:19:09,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:19:09,404 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:19:09,428 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i[919,932] [2023-12-16 03:19:09,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:19:09,492 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:19:09,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09 WrapperNode [2023-12-16 03:19:09,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:19:09,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:19:09,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:19:09,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:19:09,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,549 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2023-12-16 03:19:09,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:19:09,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:19:09,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:19:09,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:19:09,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,573 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:19:09,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:19:09,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:19:09,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:19:09,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:19:09,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (1/1) ... [2023-12-16 03:19:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:19:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:19:09,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:19:09,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:19:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:19:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:19:09,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:19:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:19:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:19:09,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:19:09,761 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:19:09,765 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:19:10,095 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:19:10,127 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:19:10,127 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:19:10,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:19:10 BoogieIcfgContainer [2023-12-16 03:19:10,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:19:10,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:19:10,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:19:10,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:19:10,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:19:09" (1/3) ... [2023-12-16 03:19:10,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aacff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:19:10, skipping insertion in model container [2023-12-16 03:19:10,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:19:09" (2/3) ... [2023-12-16 03:19:10,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39aacff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:19:10, skipping insertion in model container [2023-12-16 03:19:10,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:19:10" (3/3) ... [2023-12-16 03:19:10,134 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-11.i [2023-12-16 03:19:10,148 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:19:10,149 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:19:10,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:19:10,205 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@43420645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:19:10,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:19:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 03:19:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 03:19:10,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:19:10,226 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:19:10,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:19:10,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:19:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash 104009431, now seen corresponding path program 1 times [2023-12-16 03:19:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:19:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746229421] [2023-12-16 03:19:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:19:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:19:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:19:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:19:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:19:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:19:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:19:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:19:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:19:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:19:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:19:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:19:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:19:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:19:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:19:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:19:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:19:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:19:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:19:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:19:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:19:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:19:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:19:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:19:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 03:19:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:19:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:19:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-16 03:19:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-16 03:19:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:19:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746229421] [2023-12-16 03:19:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746229421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:19:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:19:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:19:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836832839] [2023-12-16 03:19:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:19:10,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:19:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:19:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:19:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:19:10,677 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-16 03:19:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:19:10,736 INFO L93 Difference]: Finished difference Result 155 states and 285 transitions. [2023-12-16 03:19:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:19:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2023-12-16 03:19:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:19:10,746 INFO L225 Difference]: With dead ends: 155 [2023-12-16 03:19:10,746 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 03:19:10,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:19:10,753 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:19:10,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:19:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 03:19:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-16 03:19:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 03:19:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2023-12-16 03:19:10,806 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 167 [2023-12-16 03:19:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:19:10,806 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2023-12-16 03:19:10,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-16 03:19:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2023-12-16 03:19:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 03:19:10,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:19:10,810 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:19:10,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:19:10,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:19:10,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:19:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1518491357, now seen corresponding path program 1 times [2023-12-16 03:19:10,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:19:10,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935082027] [2023-12-16 03:19:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:19:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:19:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:19:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:19:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:19:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:19:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:19:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:19:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:19:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:19:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:19:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:19:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:19:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:19:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:19:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:19:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:19:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:19:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:19:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:19:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:19:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:19:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:19:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:19:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 03:19:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:19:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:19:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-16 03:19:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-16 03:19:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:19:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935082027] [2023-12-16 03:19:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935082027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:19:11,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:19:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:19:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995043510] [2023-12-16 03:19:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:19:11,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:19:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:19:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:19:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:19:11,967 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-16 03:19:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:19:12,078 INFO L93 Difference]: Finished difference Result 176 states and 285 transitions. [2023-12-16 03:19:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:19:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2023-12-16 03:19:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:19:12,085 INFO L225 Difference]: With dead ends: 176 [2023-12-16 03:19:12,085 INFO L226 Difference]: Without dead ends: 100 [2023-12-16 03:19:12,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:19:12,090 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 76 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:19:12,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 334 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:19:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-16 03:19:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2023-12-16 03:19:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 56 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 03:19:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2023-12-16 03:19:12,113 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 167 [2023-12-16 03:19:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:19:12,115 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2023-12-16 03:19:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-16 03:19:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2023-12-16 03:19:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 03:19:12,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:19:12,127 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:19:12,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:19:12,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:19:12,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:19:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1575749659, now seen corresponding path program 1 times [2023-12-16 03:19:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:19:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960822081] [2023-12-16 03:19:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:19:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:19:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:19:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:19:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:19:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:19:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:19:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:19:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:19:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:19:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:19:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:19:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:19:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:19:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:19:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:19:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:19:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:19:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:19:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:19:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:19:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:19:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:19:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:19:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 03:19:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:19:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:19:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-16 03:19:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-16 03:19:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:19:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960822081] [2023-12-16 03:19:12,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960822081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:19:12,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:19:12,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:19:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140807489] [2023-12-16 03:19:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:19:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:19:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:19:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:19:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:19:12,552 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-16 03:19:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:19:12,764 INFO L93 Difference]: Finished difference Result 254 states and 410 transitions. [2023-12-16 03:19:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:19:12,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2023-12-16 03:19:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:19:12,767 INFO L225 Difference]: With dead ends: 254 [2023-12-16 03:19:12,767 INFO L226 Difference]: Without dead ends: 170 [2023-12-16 03:19:12,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:19:12,769 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 130 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:19:12,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 414 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:19:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-16 03:19:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 133. [2023-12-16 03:19:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 03:19:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 211 transitions. [2023-12-16 03:19:12,791 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 211 transitions. Word has length 167 [2023-12-16 03:19:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:19:12,791 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 211 transitions. [2023-12-16 03:19:12,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-16 03:19:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 211 transitions. [2023-12-16 03:19:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 03:19:12,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:19:12,793 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:19:12,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:19:12,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:19:12,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:19:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1733957685, now seen corresponding path program 1 times [2023-12-16 03:19:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:19:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627857802] [2023-12-16 03:19:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:19:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:19:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:19:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:19:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:19:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:19:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:19:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:19:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:19:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:19:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:19:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:19:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:19:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:19:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:19:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:19:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:19:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:19:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:19:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:19:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:19:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:19:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:19:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:19:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 03:19:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:19:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:19:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-16 03:19:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-16 03:19:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:19:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627857802] [2023-12-16 03:19:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627857802] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:19:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985845891] [2023-12-16 03:19:13,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:19:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:19:13,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:19:13,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:19:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:13,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 03:19:13,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:19:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2023-12-16 03:19:14,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:19:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-16 03:19:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985845891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:19:14,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:19:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2023-12-16 03:19:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562074804] [2023-12-16 03:19:14,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:19:14,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 03:19:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:19:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 03:19:14,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-16 03:19:14,539 INFO L87 Difference]: Start difference. First operand 133 states and 211 transitions. Second operand has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2023-12-16 03:19:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:19:14,770 INFO L93 Difference]: Finished difference Result 225 states and 348 transitions. [2023-12-16 03:19:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:19:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 168 [2023-12-16 03:19:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:19:14,773 INFO L225 Difference]: With dead ends: 225 [2023-12-16 03:19:14,773 INFO L226 Difference]: Without dead ends: 141 [2023-12-16 03:19:14,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2023-12-16 03:19:14,774 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 266 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:19:14,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 191 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:19:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-16 03:19:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2023-12-16 03:19:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 03:19:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2023-12-16 03:19:14,804 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 168 [2023-12-16 03:19:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:19:14,805 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2023-12-16 03:19:14,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2023-12-16 03:19:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2023-12-16 03:19:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-16 03:19:14,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:19:14,808 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:19:14,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:19:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:19:15,015 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:19:15,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:19:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 42234183, now seen corresponding path program 1 times [2023-12-16 03:19:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:19:15,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283761589] [2023-12-16 03:19:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:19:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:19:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:19:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:19:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:19:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:19:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:19:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:19:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:19:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:19:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:19:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:19:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:19:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:19:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:19:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:19:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:19:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:19:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-16 03:19:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:19:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:19:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:19:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 03:19:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-16 03:19:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-16 03:19:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-16 03:19:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-16 03:19:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-16 03:19:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 75 proven. 303 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2023-12-16 03:19:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:19:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283761589] [2023-12-16 03:19:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283761589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:19:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600545601] [2023-12-16 03:19:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:19:34,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:19:34,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:19:34,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:19:34,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 03:19:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:19:35,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 03:19:35,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:19:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 560 proven. 336 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2023-12-16 03:19:39,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 03:20:11,071 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 03:20:11,072 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 03:20:11,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:20:11,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 03:20:11,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:20:11,737 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 170 with TraceHistMax 27,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-8-3-1 context. [2023-12-16 03:20:11,741 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 03:20:11,742 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:20:11,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:20:11 BoogieIcfgContainer [2023-12-16 03:20:11,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:20:11,744 INFO L158 Benchmark]: Toolchain (without parser) took 62623.74ms. Allocated memory was 183.5MB in the beginning and 536.9MB in the end (delta: 353.4MB). Free memory was 136.5MB in the beginning and 443.5MB in the end (delta: -307.0MB). Peak memory consumption was 47.1MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,744 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:20:11,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.73ms. Allocated memory is still 183.5MB. Free memory was 136.2MB in the beginning and 121.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 183.5MB. Free memory was 121.5MB in the beginning and 118.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,745 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 183.5MB. Free memory was 118.4MB in the beginning and 115.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,745 INFO L158 Benchmark]: RCFGBuilder took 538.42ms. Allocated memory is still 183.5MB. Free memory was 115.3MB in the beginning and 150.5MB in the end (delta: -35.2MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,746 INFO L158 Benchmark]: TraceAbstraction took 61613.91ms. Allocated memory was 183.5MB in the beginning and 536.9MB in the end (delta: 353.4MB). Free memory was 149.9MB in the beginning and 443.5MB in the end (delta: -293.6MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2023-12-16 03:20:11,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.73ms. Allocated memory is still 183.5MB. Free memory was 136.2MB in the beginning and 121.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 183.5MB. Free memory was 121.5MB in the beginning and 118.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 183.5MB. Free memory was 118.4MB in the beginning and 115.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 538.42ms. Allocated memory is still 183.5MB. Free memory was 115.3MB in the beginning and 150.5MB in the end (delta: -35.2MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * TraceAbstraction took 61613.91ms. Allocated memory was 183.5MB in the beginning and 536.9MB in the end (delta: 353.4MB). Free memory was 149.9MB in the beginning and 443.5MB in the end (delta: -293.6MB). Peak memory consumption was 59.3MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 170 with TraceHistMax 27,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-8-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 1060 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 435 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 576 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 837 NumberOfCodeBlocks, 837 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 3370 SizeOfPredicates, 6 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8217/8424 InterpolantCoveringCapability, 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown