./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_loopvsstraightlinecode_50-while_file-56.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 57abe4a17479f92187af35d02268c3491944d7b837e25c921d34fc68b95e20be --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:54:46,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:54:46,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:54:46,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:54:46,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:54:46,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:54:46,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:54:46,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:54:46,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:54:46,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:54:46,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:54:46,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:54:46,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:54:46,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:54:46,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:54:46,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:54:46,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:54:46,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:54:46,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:54:46,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:54:46,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:54:46,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:54:46,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:54:46,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:54:46,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:54:46,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:54:46,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:54:46,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:54:46,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:54:46,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:54:46,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:54:46,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:54:46,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:54:46,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:54:46,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:54:46,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:54:46,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:54:46,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:54:46,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:54:46,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:54:46,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:54:46,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:54:46,531 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 -> 57abe4a17479f92187af35d02268c3491944d7b837e25c921d34fc68b95e20be [2024-11-12 05:54:46,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:54:46,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:54:46,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:54:46,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:54:46,818 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:54:46,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-56.i [2024-11-12 05:54:48,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:54:48,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:54:48,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-56.i [2024-11-12 05:54:48,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448dd15bd/0bb64ba4b67e4804ad1a99845e9c0c00/FLAGc6c166e35 [2024-11-12 05:54:48,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448dd15bd/0bb64ba4b67e4804ad1a99845e9c0c00 [2024-11-12 05:54:48,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:54:48,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:54:48,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:54:48,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:54:48,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:54:48,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:48,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7144afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48, skipping insertion in model container [2024-11-12 05:54:48,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:48,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:54:48,800 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_loopvsstraightlinecode_50-while_file-56.i[915,928] [2024-11-12 05:54:48,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:54:48,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:54:48,904 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_loopvsstraightlinecode_50-while_file-56.i[915,928] [2024-11-12 05:54:48,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:54:48,997 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:54:48,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48 WrapperNode [2024-11-12 05:54:48,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:54:48,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:54:48,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:54:48,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:54:49,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,102 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-12 05:54:49,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:54:49,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:54:49,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:54:49,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:54:49,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,146 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-12 05:54:49,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:54:49,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:54:49,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:54:49,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:54:49,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (1/1) ... [2024-11-12 05:54:49,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:54:49,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:54:49,233 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-12 05:54:49,238 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-12 05:54:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:54:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:54:49,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:54:49,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:54:49,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:54:49,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:54:49,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:54:49,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:54:49,717 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:54:49,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:54:49,735 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:54:49,736 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:54:49,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:49 BoogieIcfgContainer [2024-11-12 05:54:49,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:54:49,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:54:49,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:54:49,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:54:49,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:54:48" (1/3) ... [2024-11-12 05:54:49,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bddae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:49, skipping insertion in model container [2024-11-12 05:54:49,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:54:48" (2/3) ... [2024-11-12 05:54:49,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bddae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:49, skipping insertion in model container [2024-11-12 05:54:49,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:49" (3/3) ... [2024-11-12 05:54:49,745 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-56.i [2024-11-12 05:54:49,762 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:54:49,763 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:54:49,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:54:49,846 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;@46a97cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:54:49,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:54:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:54:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:54:49,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:49,865 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:54:49,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -740184149, now seen corresponding path program 1 times [2024-11-12 05:54:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56066812] [2024-11-12 05:54:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:54:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:54:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:54:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:54:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:54:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:54:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:54:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:54:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:54:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:54:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:54:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56066812] [2024-11-12 05:54:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56066812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:54:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189284564] [2024-11-12 05:54:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:54:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:54:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:54:50,444 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 05:54:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:50,479 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2024-11-12 05:54:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:54:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 05:54:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:50,491 INFO L225 Difference]: With dead ends: 117 [2024-11-12 05:54:50,491 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 05:54:50,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 05:54:50,499 INFO L435 NwaCegarLoop]: 86 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, 86 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-12 05:54:50,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:54:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 05:54:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 05:54:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:54:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-12 05:54:50,554 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 139 [2024-11-12 05:54:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-12 05:54:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 05:54:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-12 05:54:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:54:50,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:50,562 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:54:50,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:54:50,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1981958379, now seen corresponding path program 1 times [2024-11-12 05:54:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673886702] [2024-11-12 05:54:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:54:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:54:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:54:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:54:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:54:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:54:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:54:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:54:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:54:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:54:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:54:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:51,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673886702] [2024-11-12 05:54:51,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673886702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:51,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:51,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:54:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71609593] [2024-11-12 05:54:51,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:51,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:54:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:54:51,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:54:51,250 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:54:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:51,303 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2024-11-12 05:54:51,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:54:51,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 05:54:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:51,308 INFO L225 Difference]: With dead ends: 113 [2024-11-12 05:54:51,310 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 05:54:51,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-12 05:54:51,312 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:51,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:54:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 05:54:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 05:54:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:54:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-12 05:54:51,329 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-12 05:54:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:51,332 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-12 05:54:51,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:54:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-12 05:54:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:54:51,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:51,336 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:54:51,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:54:51,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1924700077, now seen corresponding path program 1 times [2024-11-12 05:54:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896421319] [2024-11-12 05:54:51,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:54:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:54:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:54:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:54:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:54:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:54:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:54:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:54:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:54:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:54:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:54:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:54:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:54:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:54:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:54:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:54:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:54:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:54:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:54:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:54:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:54:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:54:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:54:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:54:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896421319] [2024-11-12 05:54:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896421319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:54:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914488663] [2024-11-12 05:54:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:52,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:54:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:54:52,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:54:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:52,141 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:54:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:52,276 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2024-11-12 05:54:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:54:52,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 05:54:52,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:52,281 INFO L225 Difference]: With dead ends: 155 [2024-11-12 05:54:52,281 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 05:54:52,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:52,288 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 264 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:54:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 05:54:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2024-11-12 05:54:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:54:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-12 05:54:52,307 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 139 [2024-11-12 05:54:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:52,311 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-12 05:54:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:54:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-12 05:54:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:54:52,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:52,314 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:54:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:54:52,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1115353451, now seen corresponding path program 1 times [2024-11-12 05:54:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:54:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442351181] [2024-11-12 05:54:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:54:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat