./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.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 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:07:58,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:07:58,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:07:58,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:07:58,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:07:58,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:07:58,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:07:58,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:07:58,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:07:58,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:07:58,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:07:58,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:07:58,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:07:58,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:07:58,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:07:58,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:07:58,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:07:58,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:07:58,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:07:58,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:07:58,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:07:58,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:07:58,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:07:58,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:07:58,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:07:58,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:07:58,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:07:58,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:07:58,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:07:58,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:07:58,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:07:58,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:07:58,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:07:58,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:07:58,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:07:58,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:07:58,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:07:58,415 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 -> 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 [2024-11-08 22:07:58,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:07:58,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:07:58,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:07:58,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:07:58,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:07:58,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-11-08 22:08:00,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:08:00,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:08:00,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-11-08 22:08:00,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca11b91fa/762bb3e04b7844c696a88445c4015697/FLAG26d88d326 [2024-11-08 22:08:00,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca11b91fa/762bb3e04b7844c696a88445c4015697 [2024-11-08 22:08:00,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:08:00,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:08:00,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:08:00,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:08:00,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:08:00,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:08:00" (1/1) ... [2024-11-08 22:08:00,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a93e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:00, skipping insertion in model container [2024-11-08 22:08:00,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:08:00" (1/1) ... [2024-11-08 22:08:00,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:08:01,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-11-08 22:08:01,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:08:01,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:08:01,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2024-11-08 22:08:01,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:08:01,190 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:08:01,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01 WrapperNode [2024-11-08 22:08:01,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:08:01,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:08:01,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:08:01,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:08:01,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,250 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-08 22:08:01,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:08:01,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:08:01,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:08:01,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:08:01,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,278 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:08:01,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:08:01,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:08:01,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:08:01,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:08:01,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (1/1) ... [2024-11-08 22:08:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:08:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:08:01,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:08:01,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:08:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:08:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:08:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:08:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:08:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:08:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:08:01,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:08:01,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:08:01,777 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:08:01,778 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:08:01,790 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:08:01,791 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:08:01,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:08:01 BoogieIcfgContainer [2024-11-08 22:08:01,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:08:01,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:08:01,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:08:01,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:08:01,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:08:00" (1/3) ... [2024-11-08 22:08:01,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1e6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:08:01, skipping insertion in model container [2024-11-08 22:08:01,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:08:01" (2/3) ... [2024-11-08 22:08:01,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1e6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:08:01, skipping insertion in model container [2024-11-08 22:08:01,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:08:01" (3/3) ... [2024-11-08 22:08:01,799 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2024-11-08 22:08:01,812 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:08:01,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:08:01,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:08:01,867 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;@19238a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:08:01,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:08:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 22:08:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:01,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:01,889 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:01,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1942846472, now seen corresponding path program 1 times [2024-11-08 22:08:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:01,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468011252] [2024-11-08 22:08:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 22:08:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468011252] [2024-11-08 22:08:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468011252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:08:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:08:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:08:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542462436] [2024-11-08 22:08:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:08:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:08:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:08:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:08:02,398 INFO L87 Difference]: Start difference. First operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 22:08:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:02,449 INFO L93 Difference]: Finished difference Result 166 states and 290 transitions. [2024-11-08 22:08:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:08:02,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-11-08 22:08:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:02,459 INFO L225 Difference]: With dead ends: 166 [2024-11-08 22:08:02,460 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 22:08:02,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:08:02,464 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:02,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:08:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 22:08:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 22:08:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 22:08:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-08 22:08:02,537 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 165 [2024-11-08 22:08:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-08 22:08:02,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 22:08:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-08 22:08:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:02,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:02,542 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:08:02,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:02,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 675770612, now seen corresponding path program 1 times [2024-11-08 22:08:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676760051] [2024-11-08 22:08:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 22:08:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676760051] [2024-11-08 22:08:03,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676760051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:08:03,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:08:03,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:08:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351766550] [2024-11-08 22:08:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:08:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:08:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:08:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:08:03,456 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:03,606 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2024-11-08 22:08:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:08:03,609 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 22:08:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:03,612 INFO L225 Difference]: With dead ends: 239 [2024-11-08 22:08:03,612 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 22:08:03,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 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-11-08 22:08:03,614 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:03,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 203 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:08:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 22:08:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-11-08 22:08:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 22:08:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2024-11-08 22:08:03,669 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 165 [2024-11-08 22:08:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:03,669 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2024-11-08 22:08:03,670 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2024-11-08 22:08:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:03,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:03,672 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:03,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:08:03,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 677617654, now seen corresponding path program 1 times [2024-11-08 22:08:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944545875] [2024-11-08 22:08:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 22:08:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944545875] [2024-11-08 22:08:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944545875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:08:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:08:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:08:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588492489] [2024-11-08 22:08:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:08:04,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:08:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:08:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:08:04,077 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:04,165 INFO L93 Difference]: Finished difference Result 460 states and 682 transitions. [2024-11-08 22:08:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:08:04,166 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 22:08:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:04,173 INFO L225 Difference]: With dead ends: 460 [2024-11-08 22:08:04,173 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 22:08:04,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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-11-08 22:08:04,178 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:04,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 300 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:08:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 22:08:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 241. [2024-11-08 22:08:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 180 states have (on average 1.3777777777777778) internal successors, (248), 182 states have internal predecessors, (248), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:08:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 360 transitions. [2024-11-08 22:08:04,221 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 360 transitions. Word has length 165 [2024-11-08 22:08:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 360 transitions. [2024-11-08 22:08:04,222 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 360 transitions. [2024-11-08 22:08:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:04,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:04,226 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:04,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:08:04,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -23446924, now seen corresponding path program 1 times [2024-11-08 22:08:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353009366] [2024-11-08 22:08:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 22:08:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353009366] [2024-11-08 22:08:04,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353009366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:08:04,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:08:04,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:08:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236475150] [2024-11-08 22:08:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:08:04,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:08:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:08:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:08:04,645 INFO L87 Difference]: Start difference. First operand 241 states and 360 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:04,736 INFO L93 Difference]: Finished difference Result 543 states and 800 transitions. [2024-11-08 22:08:04,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:08:04,737 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-08 22:08:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:04,740 INFO L225 Difference]: With dead ends: 543 [2024-11-08 22:08:04,740 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 22:08:04,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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-11-08 22:08:04,746 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 94 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:04,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 364 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:08:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 22:08:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2024-11-08 22:08:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 184 states have internal predecessors, (250), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:08:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 362 transitions. [2024-11-08 22:08:04,792 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 362 transitions. Word has length 165 [2024-11-08 22:08:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:04,794 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 362 transitions. [2024-11-08 22:08:04,794 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), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 362 transitions. [2024-11-08 22:08:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:04,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:04,799 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:04,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:08:04,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:04,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 935783092, now seen corresponding path program 1 times [2024-11-08 22:08:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493674755] [2024-11-08 22:08:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 22:08:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:05,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493674755] [2024-11-08 22:08:05,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493674755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:08:05,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547634351] [2024-11-08 22:08:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:05,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:08:05,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:08:05,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:08:05,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:08:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:05,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 22:08:05,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:08:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-08 22:08:08,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:08:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-08 22:08:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547634351] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:08:10,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:08:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2024-11-08 22:08:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547417298] [2024-11-08 22:08:10,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:08:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 22:08:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 22:08:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-08 22:08:10,022 INFO L87 Difference]: Start difference. First operand 243 states and 362 transitions. Second operand has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2024-11-08 22:08:19,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:08:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:20,235 INFO L93 Difference]: Finished difference Result 999 states and 1437 transitions. [2024-11-08 22:08:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-08 22:08:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) Word has length 165 [2024-11-08 22:08:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:20,241 INFO L225 Difference]: With dead ends: 999 [2024-11-08 22:08:20,241 INFO L226 Difference]: Without dead ends: 759 [2024-11-08 22:08:20,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1428, Invalid=5214, Unknown=0, NotChecked=0, Total=6642 [2024-11-08 22:08:20,243 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1091 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 707 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:20,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1453 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2233 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2024-11-08 22:08:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-11-08 22:08:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 569. [2024-11-08 22:08:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 405 states have (on average 1.2987654320987654) internal successors, (526), 410 states have internal predecessors, (526), 145 states have call successors, (145), 18 states have call predecessors, (145), 18 states have return successors, (145), 140 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-08 22:08:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 816 transitions. [2024-11-08 22:08:20,318 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 816 transitions. Word has length 165 [2024-11-08 22:08:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:20,318 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 816 transitions. [2024-11-08 22:08:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.185185185185185) internal successors, (113), 26 states have internal predecessors, (113), 8 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 8 states have call predecessors, (75), 8 states have call successors, (75) [2024-11-08 22:08:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 816 transitions. [2024-11-08 22:08:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 22:08:20,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:20,320 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:20,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:08:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:08:20,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1419894474, now seen corresponding path program 1 times [2024-11-08 22:08:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803406913] [2024-11-08 22:08:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 22:08:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803406913] [2024-11-08 22:08:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803406913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:08:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696187590] [2024-11-08 22:08:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:08:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:08:20,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:08:20,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:08:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:20,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:08:20,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:08:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-11-08 22:08:21,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:08:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 22:08:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696187590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:08:21,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:08:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 22:08:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237158079] [2024-11-08 22:08:21,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:08:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:08:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:08:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:08:21,463 INFO L87 Difference]: Start difference. First operand 569 states and 816 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:08:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:21,658 INFO L93 Difference]: Finished difference Result 774 states and 1094 transitions. [2024-11-08 22:08:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 22:08:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 165 [2024-11-08 22:08:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:21,661 INFO L225 Difference]: With dead ends: 774 [2024-11-08 22:08:21,661 INFO L226 Difference]: Without dead ends: 361 [2024-11-08 22:08:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:08:21,663 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 116 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:21,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:08:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-08 22:08:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 319. [2024-11-08 22:08:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 213 states have (on average 1.192488262910798) internal successors, (254), 214 states have internal predecessors, (254), 87 states have call successors, (87), 18 states have call predecessors, (87), 18 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 22:08:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 428 transitions. [2024-11-08 22:08:21,713 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 428 transitions. Word has length 165 [2024-11-08 22:08:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:21,713 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 428 transitions. [2024-11-08 22:08:21,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-08 22:08:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 428 transitions. [2024-11-08 22:08:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 22:08:21,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:21,715 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:21,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 22:08:21,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 22:08:21,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1042677440, now seen corresponding path program 1 times [2024-11-08 22:08:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196479170] [2024-11-08 22:08:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:08:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 22:08:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 22:08:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 22:08:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 22:08:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 22:08:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:08:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:08:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:08:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 22:08:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:08:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:08:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:08:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:08:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:08:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:08:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:08:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:08:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 22:08:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 22:08:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 22:08:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 22:08:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 22:08:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 22:08:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 22:08:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 22:08:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:08:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196479170] [2024-11-08 22:08:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196479170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:08:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:08:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:08:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551936242] [2024-11-08 22:08:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:08:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:08:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:08:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:08:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:08:22,148 INFO L87 Difference]: Start difference. First operand 319 states and 428 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:08:22,399 INFO L93 Difference]: Finished difference Result 516 states and 710 transitions. [2024-11-08 22:08:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:08:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-08 22:08:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:08:22,405 INFO L225 Difference]: With dead ends: 516 [2024-11-08 22:08:22,405 INFO L226 Difference]: Without dead ends: 427 [2024-11-08 22:08:22,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-11-08 22:08:22,406 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 132 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:08:22,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 363 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:08:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-08 22:08:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 404. [2024-11-08 22:08:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 270 states have (on average 1.2074074074074075) internal successors, (326), 271 states have internal predecessors, (326), 112 states have call successors, (112), 21 states have call predecessors, (112), 21 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-08 22:08:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 550 transitions. [2024-11-08 22:08:22,468 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 550 transitions. Word has length 166 [2024-11-08 22:08:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:08:22,469 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 550 transitions. [2024-11-08 22:08:22,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 22:08:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 550 transitions. [2024-11-08 22:08:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 22:08:22,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:08:22,470 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:08:22,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:08:22,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:08:22,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:08:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1888107239, now seen corresponding path program 1 times [2024-11-08 22:08:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:08:22,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17845555] [2024-11-08 22:08:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:08:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:08:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717875919] [2024-11-08 22:08:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:08:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:08:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:08:22,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:08:22,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 22:08:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:08:22,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 22:08:22,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:08:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 591 proven. 93 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-08 22:08:23,160 INFO L311 TraceCheckSpWp]: Computing backward predicates...