./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.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 3bdf6e87ddd4e3fa9d4912c40adec3bde1bcd5c66861b555d5b25f0cfae6651f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:06:34,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:06:34,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:06:34,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:06:34,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:06:34,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:06:34,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:06:34,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:06:34,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:06:34,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:06:34,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:06:34,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:06:34,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:06:34,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:06:34,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:06:34,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:06:34,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:06:34,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:06:34,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:06:34,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:06:34,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:06:34,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:06:34,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:06:34,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:06:34,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:06:34,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:06:34,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:06:34,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:06:34,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:06:34,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:06:34,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:06:34,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:06:34,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:34,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:06:34,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:06:34,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:06:34,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:06:34,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:06:34,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:06:34,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:06:34,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:06:34,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:06:34,249 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 -> 3bdf6e87ddd4e3fa9d4912c40adec3bde1bcd5c66861b555d5b25f0cfae6651f [2024-10-13 04:06:34,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:06:34,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:06:34,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:06:34,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:06:34,568 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:06:34,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i [2024-10-13 04:06:35,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:06:36,195 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:06:36,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i [2024-10-13 04:06:36,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd75ff46/0f936a2afb8b46378485b2338f79ef76/FLAG40a5b0cb8 [2024-10-13 04:06:36,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd75ff46/0f936a2afb8b46378485b2338f79ef76 [2024-10-13 04:06:36,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:06:36,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:06:36,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:36,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:06:36,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:06:36,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c78129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36, skipping insertion in model container [2024-10-13 04:06:36,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:06:36,781 WARN L248 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_25-1loop_file-25.i[915,928] [2024-10-13 04:06:36,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:36,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:06:36,846 WARN L248 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_25-1loop_file-25.i[915,928] [2024-10-13 04:06:36,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:36,894 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:06:36,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36 WrapperNode [2024-10-13 04:06:36,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:36,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:36,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:06:36,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:06:36,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,933 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-13 04:06:36,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:36,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:06:36,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:06:36,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:06:36,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,964 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-10-13 04:06:36,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:06:36,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:06:36,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:06:36,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:06:36,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (1/1) ... [2024-10-13 04:06:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:06:37,026 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-10-13 04:06:37,029 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-10-13 04:06:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:06:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:06:37,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:06:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:06:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:06:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:06:37,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:06:37,234 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:06:37,553 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:06:37,553 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:06:37,620 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:06:37,622 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:06:37,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:37 BoogieIcfgContainer [2024-10-13 04:06:37,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:06:37,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:06:37,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:06:37,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:06:37,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:06:36" (1/3) ... [2024-10-13 04:06:37,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c37e746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:37, skipping insertion in model container [2024-10-13 04:06:37,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:36" (2/3) ... [2024-10-13 04:06:37,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c37e746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:37, skipping insertion in model container [2024-10-13 04:06:37,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:37" (3/3) ... [2024-10-13 04:06:37,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-25.i [2024-10-13 04:06:37,649 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:06:37,649 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:06:37,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:06:37,735 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;@23208260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:06:37,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:06:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:06:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:06:37,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:37,759 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:37,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:37,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash -778079813, now seen corresponding path program 1 times [2024-10-13 04:06:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995968323] [2024-10-13 04:06:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:38,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995968323] [2024-10-13 04:06:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995968323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:38,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:38,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:06:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370040325] [2024-10-13 04:06:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:38,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:06:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:06:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:06:38,247 INFO L87 Difference]: Start difference. First operand has 52 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:06:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:38,313 INFO L93 Difference]: Finished difference Result 103 states and 184 transitions. [2024-10-13 04:06:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:06:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 135 [2024-10-13 04:06:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:38,325 INFO L225 Difference]: With dead ends: 103 [2024-10-13 04:06:38,326 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 04:06:38,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-10-13 04:06:38,336 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:38,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:06:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 04:06:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 04:06:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:06:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2024-10-13 04:06:38,390 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 135 [2024-10-13 04:06:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:38,391 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2024-10-13 04:06:38,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:06:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2024-10-13 04:06:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:06:38,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:38,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:38,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:06:38,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1217301945, now seen corresponding path program 1 times [2024-10-13 04:06:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967079041] [2024-10-13 04:06:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967079041] [2024-10-13 04:06:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967079041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:06:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605474720] [2024-10-13 04:06:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:41,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:06:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:06:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:41,603 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:43,179 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2024-10-13 04:06:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:06:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 04:06:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:43,183 INFO L225 Difference]: With dead ends: 82 [2024-10-13 04:06:43,183 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 04:06:43,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:06:43,185 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:43,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 334 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:06:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 04:06:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2024-10-13 04:06:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:06:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-10-13 04:06:43,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 135 [2024-10-13 04:06:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:43,218 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-10-13 04:06:43,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-10-13 04:06:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:06:43,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:43,224 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:06:43,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:43,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1217361527, now seen corresponding path program 1 times [2024-10-13 04:06:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436382791] [2024-10-13 04:06:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436382791] [2024-10-13 04:06:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436382791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:06:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667822873] [2024-10-13 04:06:45,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:45,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:06:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:45,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:06:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:45,885 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:48,147 INFO L93 Difference]: Finished difference Result 79 states and 111 transitions. [2024-10-13 04:06:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:06:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 04:06:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:48,152 INFO L225 Difference]: With dead ends: 79 [2024-10-13 04:06:48,152 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 04:06:48,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:06:48,154 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:48,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 341 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:06:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 04:06:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-10-13 04:06:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:06:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-10-13 04:06:48,173 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 135 [2024-10-13 04:06:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:48,174 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-10-13 04:06:48,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-10-13 04:06:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:06:48,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:48,176 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:06:48,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1219148987, now seen corresponding path program 1 times [2024-10-13 04:06:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743376968] [2024-10-13 04:06:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743376968] [2024-10-13 04:06:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743376968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:51,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:51,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:06:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765770014] [2024-10-13 04:06:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:51,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:06:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:51,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:06:51,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:51,141 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:52,754 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2024-10-13 04:06:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:06:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 04:06:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:52,756 INFO L225 Difference]: With dead ends: 93 [2024-10-13 04:06:52,756 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 04:06:52,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:06:52,758 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 33 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:52,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 336 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:06:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 04:06:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2024-10-13 04:06:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:06:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-10-13 04:06:52,789 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 135 [2024-10-13 04:06:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:52,790 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-10-13 04:06:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-10-13 04:06:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 04:06:52,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:52,793 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:06:52,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1219208569, now seen corresponding path program 1 times [2024-10-13 04:06:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901627992] [2024-10-13 04:06:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901627992] [2024-10-13 04:06:54,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901627992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:54,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:54,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:06:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013832227] [2024-10-13 04:06:54,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:54,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:06:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:54,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:06:54,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:54,152 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:54,623 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2024-10-13 04:06:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:06:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 135 [2024-10-13 04:06:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:54,629 INFO L225 Difference]: With dead ends: 81 [2024-10-13 04:06:54,629 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 04:06:54,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:06:54,630 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:54,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 201 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:06:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 04:06:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-10-13 04:06:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:06:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-10-13 04:06:54,657 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 135 [2024-10-13 04:06:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:54,658 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-10-13 04:06:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-10-13 04:06:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 04:06:54,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:54,660 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 04:06:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:06:54,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 307623736, now seen corresponding path program 1 times [2024-10-13 04:06:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:54,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627765274] [2024-10-13 04:06:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:54,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:06:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627765274] [2024-10-13 04:06:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627765274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:06:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217131926] [2024-10-13 04:06:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:54,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:06:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:06:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:06:54,854 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:54,966 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-10-13 04:06:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:06:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-13 04:06:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:54,969 INFO L225 Difference]: With dead ends: 192 [2024-10-13 04:06:54,969 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 04:06:54,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:54,971 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 43 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:54,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 211 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 04:06:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-10-13 04:06:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 58 states have internal predecessors, (65), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 04:06:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-10-13 04:06:55,004 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 136 [2024-10-13 04:06:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:55,004 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-10-13 04:06:55,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:06:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-10-13 04:06:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 04:06:55,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:55,008 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:55,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:06:55,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:55,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash 664521880, now seen corresponding path program 1 times [2024-10-13 04:06:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:55,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386956224] [2024-10-13 04:06:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:06:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:06:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 04:06:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 04:06:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 04:06:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 04:06:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 04:06:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 04:06:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 04:06:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:06:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:06:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:06:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 04:06:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 04:06:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 04:06:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 04:06:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 04:06:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 04:06:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 04:06:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 04:06:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 04:06:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 04:06:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 04:06:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 04:06:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 04:06:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-13 04:06:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 04:06:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-13 04:06:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 04:06:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-13 04:06:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 04:06:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-13 04:06:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4181 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2024-10-13 04:06:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386956224] [2024-10-13 04:06:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386956224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:06:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621172573] [2024-10-13 04:06:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:06:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:06:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:06:55,210 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 04:06:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:55,267 INFO L93 Difference]: Finished difference Result 162 states and 240 transitions. [2024-10-13 04:06:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:06:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 270 [2024-10-13 04:06:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:55,268 INFO L225 Difference]: With dead ends: 162 [2024-10-13 04:06:55,268 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 04:06:55,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:06:55,270 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:55,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:06:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 04:06:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 04:06:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 04:06:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 04:06:55,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 270 [2024-10-13 04:06:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 04:06:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-13 04:06:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 04:06:55,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 04:06:55,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:06:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:06:55,283 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:06:55,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 04:06:55,496 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:06:55,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:06:55 BoogieIcfgContainer [2024-10-13 04:06:55,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:06:55,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:06:55,517 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:06:55,517 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:06:55,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:37" (3/4) ... [2024-10-13 04:06:55,519 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 04:06:55,523 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 04:06:55,529 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 04:06:55,529 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 04:06:55,529 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 04:06:55,530 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 04:06:55,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 04:06:55,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 04:06:55,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:06:55,641 INFO L158 Benchmark]: Toolchain (without parser) took 19072.28ms. Allocated memory was 153.1MB in the beginning and 388.0MB in the end (delta: 234.9MB). Free memory was 76.4MB in the beginning and 200.4MB in the end (delta: -124.1MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,641 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:06:55,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.72ms. Allocated memory is still 153.1MB. Free memory was 76.1MB in the beginning and 119.6MB in the end (delta: -43.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 153.1MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,642 INFO L158 Benchmark]: Boogie Preprocessor took 45.07ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 114.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,642 INFO L158 Benchmark]: RCFGBuilder took 642.45ms. Allocated memory is still 153.1MB. Free memory was 114.6MB in the beginning and 108.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,642 INFO L158 Benchmark]: TraceAbstraction took 17891.31ms. Allocated memory was 153.1MB in the beginning and 388.0MB in the end (delta: 234.9MB). Free memory was 107.4MB in the beginning and 206.7MB in the end (delta: -99.3MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,642 INFO L158 Benchmark]: Witness Printer took 123.65ms. Allocated memory is still 388.0MB. Free memory was 206.7MB in the beginning and 200.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:06:55,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.72ms. Allocated memory is still 153.1MB. Free memory was 76.1MB in the beginning and 119.6MB in the end (delta: -43.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 153.1MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.07ms. Allocated memory is still 153.1MB. Free memory was 117.4MB in the beginning and 114.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.45ms. Allocated memory is still 153.1MB. Free memory was 114.6MB in the beginning and 108.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17891.31ms. Allocated memory was 153.1MB in the beginning and 388.0MB in the end (delta: 234.9MB). Free memory was 107.4MB in the beginning and 206.7MB in the end (delta: -99.3MB). Peak memory consumption was 137.5MB. Max. memory is 16.1GB. * Witness Printer took 123.65ms. Allocated memory is still 388.0MB. Free memory was 206.7MB in the beginning and 200.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 7, TraceHistogramMax: 46, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 1607 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1102 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 505 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 2779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10253/10253 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (k_loop == 0)) || (0 < k_loop)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_6 == 0) && (last_1_var_1_6 == 0)) Ensures: ((var_1_6 == 0) && (last_1_var_1_6 == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-13 04:06:55,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE