./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:21:42,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:21:42,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:21:42,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:21:42,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:21:42,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:21:42,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:21:42,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:21:42,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:21:42,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:21:42,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:21:42,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:21:42,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:21:42,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:21:42,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:21:42,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:21:42,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:21:42,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:21:42,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:21:42,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:21:42,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:21:42,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:21:42,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:21:42,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:21:42,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:21:42,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:21:42,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:21:42,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:21:42,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:21:42,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:21:42,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:21:42,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:21:42,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:21:42,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:21:42,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:21:42,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:21:42,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:21:42,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:21:42,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:21:42,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:21:42,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:21:42,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:21:42,755 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 [2024-11-08 19:21:43,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:21:43,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:21:43,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:21:43,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:21:43,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:21:43,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-08 19:21:44,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:21:44,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:21:44,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-08 19:21:44,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28523cf65/1dbfd33e96b743399fec5db6fd9905ce/FLAG8b0faa0f9 [2024-11-08 19:21:45,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28523cf65/1dbfd33e96b743399fec5db6fd9905ce [2024-11-08 19:21:45,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:21:45,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:21:45,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:21:45,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:21:45,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:21:45,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6124acea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45, skipping insertion in model container [2024-11-08 19:21:45,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:21:45,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i[919,932] [2024-11-08 19:21:45,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:21:45,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:21:45,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i[919,932] [2024-11-08 19:21:45,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:21:45,370 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:21:45,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45 WrapperNode [2024-11-08 19:21:45,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:21:45,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:21:45,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:21:45,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:21:45,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,461 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-08 19:21:45,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:21:45,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:21:45,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:21:45,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:21:45,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,513 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]. [2024-11-08 19:21:45,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:21:45,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:21:45,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:21:45,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:21:45,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (1/1) ... [2024-11-08 19:21:45,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:21:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:21:45,584 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) [2024-11-08 19:21:45,591 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 [2024-11-08 19:21:45,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:21:45,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:21:45,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:21:45,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:21:45,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:21:45,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:21:45,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:21:45,725 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:21:46,130 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:21:46,130 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:21:46,150 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:21:46,150 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:21:46,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:21:46 BoogieIcfgContainer [2024-11-08 19:21:46,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:21:46,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:21:46,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:21:46,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:21:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:21:45" (1/3) ... [2024-11-08 19:21:46,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48695c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:21:46, skipping insertion in model container [2024-11-08 19:21:46,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:21:45" (2/3) ... [2024-11-08 19:21:46,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48695c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:21:46, skipping insertion in model container [2024-11-08 19:21:46,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:21:46" (3/3) ... [2024-11-08 19:21:46,162 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-31.i [2024-11-08 19:21:46,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:21:46,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:21:46,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:21:46,251 INFO L333 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, 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;@32260029, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:21:46,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:21:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:21:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:21:46,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:46,270 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:21:46,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -831968484, now seen corresponding path program 1 times [2024-11-08 19:21:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926630719] [2024-11-08 19:21:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:21:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:21:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:21:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:21:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:21:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:21:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:21:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:21:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:21:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:21:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:21:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:21:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:21:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:21:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:21:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:21:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:21:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:21:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926630719] [2024-11-08 19:21:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926630719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:21:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373789557] [2024-11-08 19:21:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:46,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:21:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:21:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:21:46,860 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:21:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:21:46,899 INFO L93 Difference]: Finished difference Result 123 states and 218 transitions. [2024-11-08 19:21:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:21:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2024-11-08 19:21:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:21:46,910 INFO L225 Difference]: With dead ends: 123 [2024-11-08 19:21:46,910 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 19:21:46,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:21:46,922 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:21:46,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:21:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 19:21:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 19:21:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:21:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2024-11-08 19:21:46,979 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 147 [2024-11-08 19:21:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:21:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2024-11-08 19:21:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:21:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2024-11-08 19:21:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:21:46,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:46,988 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:21:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:21:46,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2027103460, now seen corresponding path program 1 times [2024-11-08 19:21:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700627643] [2024-11-08 19:21:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:21:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:21:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:21:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:21:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:21:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:21:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:21:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:21:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:21:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:21:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:21:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:21:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:21:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:21:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:21:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:21:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:21:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:21:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700627643] [2024-11-08 19:21:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700627643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:21:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250925966] [2024-11-08 19:21:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:21:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:21:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:21:52,766 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:21:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:21:54,356 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2024-11-08 19:21:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:21:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-08 19:21:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:21:54,360 INFO L225 Difference]: With dead ends: 199 [2024-11-08 19:21:54,360 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 19:21:54,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:21:54,362 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 127 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:21:54,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 614 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 19:21:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 19:21:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2024-11-08 19:21:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.303030303030303) internal successors, (86), 68 states have internal predecessors, (86), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:21:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-11-08 19:21:54,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 147 [2024-11-08 19:21:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:21:54,396 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-11-08 19:21:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:21:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-11-08 19:21:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:21:54,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:54,400 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:21:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:21:54,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 492856474, now seen corresponding path program 1 times [2024-11-08 19:21:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764656696] [2024-11-08 19:21:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:21:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:21:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:21:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:21:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:21:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:21:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:21:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:21:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:21:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:21:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:21:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:21:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:21:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:21:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:21:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:21:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:21:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:21:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764656696] [2024-11-08 19:21:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764656696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:21:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211073136] [2024-11-08 19:21:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:21:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:21:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:21:54,537 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:21:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:21:54,585 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2024-11-08 19:21:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:21:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-08 19:21:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:21:54,590 INFO L225 Difference]: With dead ends: 268 [2024-11-08 19:21:54,590 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 19:21:54,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:21:54,595 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:21:54,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 252 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:21:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 19:21:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2024-11-08 19:21:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 108 states have internal predecessors, (128), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 19:21:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 240 transitions. [2024-11-08 19:21:54,644 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 240 transitions. Word has length 147 [2024-11-08 19:21:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:21:54,645 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 240 transitions. [2024-11-08 19:21:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:21:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 240 transitions. [2024-11-08 19:21:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:21:54,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:54,651 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:21:54,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:21:54,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:54,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash 300425868, now seen corresponding path program 1 times [2024-11-08 19:21:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454821671] [2024-11-08 19:21:54,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:54,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat