./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:57:47,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:57:47,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:57:47,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:57:47,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:57:47,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:57:47,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:57:47,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:57:47,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:57:47,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:57:47,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:57:47,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:57:47,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:57:47,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:57:47,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:57:47,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:57:47,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:57:47,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:57:47,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:57:47,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:57:47,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:57:47,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:57:47,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:57:47,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:57:47,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:57:47,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:57:47,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:57:47,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:57:47,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:57:47,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:57:47,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:47,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:57:47,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:57:47,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:57:47,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:57:47,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:57:47,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:57:47,753 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-clean/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-clean/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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2024-10-11 09:57:47,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:57:48,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:57:48,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:57:48,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:57:48,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:57:48,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:57:49,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:57:49,726 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:57:49,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:57:49,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2078f1bbe/eba80ab24a524429ba28ecd66c85a804/FLAG228b358c2 [2024-10-11 09:57:49,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2078f1bbe/eba80ab24a524429ba28ecd66c85a804 [2024-10-11 09:57:49,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:57:49,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:57:49,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:49,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:57:49,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:57:49,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:49" (1/1) ... [2024-10-11 09:57:49,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f27bc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:49, skipping insertion in model container [2024-10-11 09:57:49,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:49" (1/1) ... [2024-10-11 09:57:49,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:57:49,925 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-10-11 09:57:49,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:49,992 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:57:50,003 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-10-11 09:57:50,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:50,043 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:57:50,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50 WrapperNode [2024-10-11 09:57:50,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:50,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:50,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:57:50,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:57:50,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,111 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-11 09:57:50,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:50,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:57:50,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:57:50,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:57:50,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,173 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:57:50,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:57:50,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:57:50,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:57:50,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:57:50,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (1/1) ... [2024-10-11 09:57:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:57:50,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:57:50,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:57:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:57:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:57:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:57:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:57:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:57:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:57:50,403 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:57:50,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:57:50,717 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:57:50,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:57:50,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:57:50,756 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:57:50,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:50 BoogieIcfgContainer [2024-10-11 09:57:50,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:57:50,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:57:50,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:57:50,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:57:50,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:57:49" (1/3) ... [2024-10-11 09:57:50,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eba2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:50, skipping insertion in model container [2024-10-11 09:57:50,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:50" (2/3) ... [2024-10-11 09:57:50,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eba2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:50, skipping insertion in model container [2024-10-11 09:57:50,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:50" (3/3) ... [2024-10-11 09:57:50,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:57:50,778 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:57:50,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:57:50,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:57:50,841 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;@5c97d80c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:57:50,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:57:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 09:57:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:57:50,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:50,856 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:50,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1100614292, now seen corresponding path program 1 times [2024-10-11 09:57:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:50,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672830734] [2024-10-11 09:57:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:57:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:57:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:57:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:57:52,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:52,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672830734] [2024-10-11 09:57:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672830734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:57:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357219233] [2024-10-11 09:57:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:57:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:57:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:57:52,210 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:52,687 INFO L93 Difference]: Finished difference Result 227 states and 410 transitions. [2024-10-11 09:57:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:57:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-11 09:57:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:52,703 INFO L225 Difference]: With dead ends: 227 [2024-10-11 09:57:52,705 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 09:57:52,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:57:52,715 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:52,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 419 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:57:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 09:57:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2024-10-11 09:57:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:57:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 200 transitions. [2024-10-11 09:57:52,797 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 200 transitions. Word has length 136 [2024-10-11 09:57:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:52,799 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 200 transitions. [2024-10-11 09:57:52,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 200 transitions. [2024-10-11 09:57:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:57:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:52,804 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:57:52,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1059656005, now seen corresponding path program 1 times [2024-10-11 09:57:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172538683] [2024-10-11 09:57:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:57:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:57:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:57:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:57:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172538683] [2024-10-11 09:57:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172538683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:57:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435430320] [2024-10-11 09:57:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:57:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:57:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:57:53,057 INFO L87 Difference]: Start difference. First operand 128 states and 200 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:53,135 INFO L93 Difference]: Finished difference Result 279 states and 434 transitions. [2024-10-11 09:57:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:57:53,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-11 09:57:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:53,138 INFO L225 Difference]: With dead ends: 279 [2024-10-11 09:57:53,138 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 09:57:53,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:57:53,140 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 76 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:53,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 304 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:57:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 09:57:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-11 09:57:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 states have internal predecessors, (192), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 09:57:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2024-10-11 09:57:53,182 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 137 [2024-10-11 09:57:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2024-10-11 09:57:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2024-10-11 09:57:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 09:57:53,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:53,189 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:53,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:57:53,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:53,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:53,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1323015625, now seen corresponding path program 1 times [2024-10-11 09:57:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112993334] [2024-10-11 09:57:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:53,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:57:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:57:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:57:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:57:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:53,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112993334] [2024-10-11 09:57:53,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112993334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:53,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:57:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808721942] [2024-10-11 09:57:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:53,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:57:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:53,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:57:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:57:53,486 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:53,699 INFO L93 Difference]: Finished difference Result 384 states and 595 transitions. [2024-10-11 09:57:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:57:53,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-11 09:57:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:53,703 INFO L225 Difference]: With dead ends: 384 [2024-10-11 09:57:53,705 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 09:57:53,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:57:53,707 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 121 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:53,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 169 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:57:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 09:57:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2024-10-11 09:57:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 09:57:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 320 transitions. [2024-10-11 09:57:53,753 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 320 transitions. Word has length 139 [2024-10-11 09:57:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 320 transitions. [2024-10-11 09:57:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:57:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 320 transitions. [2024-10-11 09:57:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 09:57:53,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:53,758 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:57:53,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181063, now seen corresponding path program 1 times [2024-10-11 09:57:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236560345] [2024-10-11 09:57:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:57:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:57:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:57:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 09:57:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:54,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236560345] [2024-10-11 09:57:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236560345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:57:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666664048] [2024-10-11 09:57:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:57:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:57:54,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:57:54,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:57:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:54,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:57:54,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:57:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 367 proven. 129 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 09:57:55,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:57:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 09:57:55,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666664048] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:57:55,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:57:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 21 [2024-10-11 09:57:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560875816] [2024-10-11 09:57:55,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:57:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 09:57:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 09:57:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:57:55,647 INFO L87 Difference]: Start difference. First operand 206 states and 320 transitions. Second operand has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (59), 4 states have call predecessors, (59), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 09:57:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:56,573 INFO L93 Difference]: Finished difference Result 442 states and 648 transitions. [2024-10-11 09:57:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 09:57:56,574 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (59), 4 states have call predecessors, (59), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 139 [2024-10-11 09:57:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:56,576 INFO L225 Difference]: With dead ends: 442 [2024-10-11 09:57:56,576 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 09:57:56,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=1291, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 09:57:56,579 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 285 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:56,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 301 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:57:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 09:57:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 239. [2024-10-11 09:57:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 166 states have (on average 1.2951807228915662) internal successors, (215), 166 states have internal predecessors, (215), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 09:57:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 335 transitions. [2024-10-11 09:57:56,611 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 335 transitions. Word has length 139 [2024-10-11 09:57:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 335 transitions. [2024-10-11 09:57:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (59), 4 states have call predecessors, (59), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 09:57:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 335 transitions. [2024-10-11 09:57:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 09:57:56,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:56,614 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:56,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:57:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:57:56,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:56,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1055669992, now seen corresponding path program 1 times [2024-10-11 09:57:56,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:56,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953309976] [2024-10-11 09:57:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:56,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:57:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593418073] [2024-10-11 09:57:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:57:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:57:56,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:57:56,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:57:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:57,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:57:57,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:57:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 415 proven. 81 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 09:57:57,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:58:07,692 WARN L249 Executor]: External (MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-11 09:58:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:58:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953309976] [2024-10-11 09:58:07,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:58:07,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593418073] [2024-10-11 09:58:07,694 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-11 09:58:07,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-10-11 09:58:07,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:58:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:58:07,895 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-10-11 09:58:07,904 INFO L158 Benchmark]: Toolchain (without parser) took 18140.13ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 137.5MB in the beginning and 123.3MB in the end (delta: 14.2MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,904 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 130.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:58:07,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.20ms. Allocated memory is still 209.7MB. Free memory was 137.5MB in the beginning and 120.4MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.37ms. Allocated memory is still 209.7MB. Free memory was 120.4MB in the beginning and 115.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,905 INFO L158 Benchmark]: Boogie Preprocessor took 104.95ms. Allocated memory is still 209.7MB. Free memory was 115.5MB in the beginning and 174.4MB in the end (delta: -58.9MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,912 INFO L158 Benchmark]: RCFGBuilder took 537.54ms. Allocated memory is still 209.7MB. Free memory was 174.4MB in the beginning and 142.0MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,913 INFO L158 Benchmark]: TraceAbstraction took 17145.24ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 141.1MB in the beginning and 123.3MB in the end (delta: 17.8MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. [2024-10-11 09:58:07,914 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 130.0MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.20ms. Allocated memory is still 209.7MB. Free memory was 137.5MB in the beginning and 120.4MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.37ms. Allocated memory is still 209.7MB. Free memory was 120.4MB in the beginning and 115.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.95ms. Allocated memory is still 209.7MB. Free memory was 115.5MB in the beginning and 174.4MB in the end (delta: -58.9MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * RCFGBuilder took 537.54ms. Allocated memory is still 209.7MB. Free memory was 174.4MB in the beginning and 142.0MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17145.24ms. Allocated memory was 209.7MB in the beginning and 343.9MB in the end (delta: 134.2MB). Free memory was 141.1MB in the beginning and 123.3MB in the end (delta: 17.8MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:58:10,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:58:10,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:58:10,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:58:10,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:58:10,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:58:10,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:58:10,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:58:10,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:58:10,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:58:10,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:58:10,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:58:10,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:58:10,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:58:10,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:58:10,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:58:10,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:58:10,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:58:10,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:58:10,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:58:10,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:58:10,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:58:10,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:58:10,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:58:10,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:58:10,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:58:10,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:58:10,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:58:10,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:58:10,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:58:10,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:58:10,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:58:10,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:58:10,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:58:10,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:58:10,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:58:10,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:58:10,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:58:10,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:58:10,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:58:10,377 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-clean/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-clean/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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2024-10-11 09:58:10,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:58:10,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:58:10,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:58:10,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:58:10,690 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:58:10,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:58:12,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:58:12,404 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:58:12,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:58:12,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f234bc17/77771f4cb8e64b02bd097e41e41efc91/FLAG061189f19 [2024-10-11 09:58:12,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f234bc17/77771f4cb8e64b02bd097e41e41efc91 [2024-10-11 09:58:12,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:58:12,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:58:12,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:58:12,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:58:12,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:58:12,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7360b043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12, skipping insertion in model container [2024-10-11 09:58:12,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:58:12,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-10-11 09:58:12,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:58:12,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:58:12,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-10-11 09:58:12,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:58:12,776 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:58:12,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12 WrapperNode [2024-10-11 09:58:12,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:58:12,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:58:12,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:58:12,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:58:12,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,832 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-11 09:58:12,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:58:12,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:58:12,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:58:12,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:58:12,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,870 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:58:12,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:58:12,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:58:12,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:58:12,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:58:12,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (1/1) ... [2024-10-11 09:58:12,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:58:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:58:12,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:58:12,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:58:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:58:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:58:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:58:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:58:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:58:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:58:13,035 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:58:13,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:58:18,545 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:58:18,545 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:58:18,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:58:18,582 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:58:18,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:58:18 BoogieIcfgContainer [2024-10-11 09:58:18,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:58:18,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:58:18,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:58:18,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:58:18,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:58:12" (1/3) ... [2024-10-11 09:58:18,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba1d8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:58:18, skipping insertion in model container [2024-10-11 09:58:18,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:58:12" (2/3) ... [2024-10-11 09:58:18,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba1d8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:58:18, skipping insertion in model container [2024-10-11 09:58:18,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:58:18" (3/3) ... [2024-10-11 09:58:18,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-10-11 09:58:18,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:58:18,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:58:18,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:58:18,676 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;@301339c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:58:18,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:58:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 09:58:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:58:18,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:18,721 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:58:18,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 665288238, now seen corresponding path program 1 times [2024-10-11 09:58:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:58:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067612712] [2024-10-11 09:58:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:18,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:58:18,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:58:18,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:58:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:19,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:58:19,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-11 09:58:19,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:58:19,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:58:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067612712] [2024-10-11 09:58:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067612712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:58:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:58:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:58:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124604681] [2024-10-11 09:58:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:19,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:58:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:58:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:58:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:58:19,183 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 09:58:21,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:21,858 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-11 09:58:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:58:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-10-11 09:58:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:21,893 INFO L225 Difference]: With dead ends: 135 [2024-10-11 09:58:21,893 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 09:58:21,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:58:21,900 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:21,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 09:58:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 09:58:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 09:58:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 09:58:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-11 09:58:21,974 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 133 [2024-10-11 09:58:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:21,974 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-11 09:58:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 09:58:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-11 09:58:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:58:21,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:21,985 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:58:21,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:58:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:22,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:22,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1097244396, now seen corresponding path program 1 times [2024-10-11 09:58:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:58:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422726139] [2024-10-11 09:58:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:58:22,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:58:22,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:58:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:22,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:58:22,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:58:23,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:58:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:58:24,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:58:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422726139] [2024-10-11 09:58:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422726139] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:58:24,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:58:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 09:58:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415959459] [2024-10-11 09:58:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:24,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:58:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:58:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:58:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:58:24,058 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 09:58:26,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:29,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:33,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:35,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:35,573 INFO L93 Difference]: Finished difference Result 219 states and 336 transitions. [2024-10-11 09:58:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:58:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 134 [2024-10-11 09:58:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:35,577 INFO L225 Difference]: With dead ends: 219 [2024-10-11 09:58:35,577 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 09:58:35,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:58:35,578 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 126 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:35,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 283 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-10-11 09:58:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 09:58:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2024-10-11 09:58:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 09:58:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 213 transitions. [2024-10-11 09:58:35,629 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 213 transitions. Word has length 134 [2024-10-11 09:58:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:35,629 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 213 transitions. [2024-10-11 09:58:35,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 09:58:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 213 transitions. [2024-10-11 09:58:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:58:35,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:35,631 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:58:35,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 09:58:35,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:35,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:35,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -941582356, now seen corresponding path program 1 times [2024-10-11 09:58:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:58:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747616646] [2024-10-11 09:58:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:58:35,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:58:35,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:58:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:36,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:58:36,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:58:37,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:58:37,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:58:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747616646] [2024-10-11 09:58:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747616646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:58:37,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:58:37,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:58:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467041326] [2024-10-11 09:58:37,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:37,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:58:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:58:37,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:58:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:58:37,780 INFO L87 Difference]: Start difference. First operand 137 states and 213 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:58:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:42,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:42,725 INFO L93 Difference]: Finished difference Result 346 states and 535 transitions. [2024-10-11 09:58:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:58:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-10-11 09:58:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:42,728 INFO L225 Difference]: With dead ends: 346 [2024-10-11 09:58:42,729 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 09:58:42,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:58:42,731 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 79 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:42,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 333 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 09:58:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 09:58:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2024-10-11 09:58:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 09:58:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2024-10-11 09:58:42,759 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 135 [2024-10-11 09:58:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2024-10-11 09:58:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:58:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2024-10-11 09:58:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:58:42,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:42,762 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:58:42,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 09:58:42,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:42,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:42,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1309022070, now seen corresponding path program 1 times [2024-10-11 09:58:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:58:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051866377] [2024-10-11 09:58:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:58:42,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:58:42,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 09:58:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:43,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:58:43,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-10-11 09:58:44,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:58:45,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:58:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051866377] [2024-10-11 09:58:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051866377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:58:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1992351209] [2024-10-11 09:58:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:45,416 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:58:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:58:45,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:58:45,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 09:58:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:45,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:58:45,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:58:45,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:58:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1992351209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:58:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:58:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 09:58:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610490366] [2024-10-11 09:58:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:58:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:58:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:58:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:58:45,931 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:58:48,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:48,575 INFO L93 Difference]: Finished difference Result 418 states and 645 transitions. [2024-10-11 09:58:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:58:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-11 09:58:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:48,583 INFO L225 Difference]: With dead ends: 418 [2024-10-11 09:58:48,583 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 09:58:48,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:58:48,585 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:48,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 228 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 09:58:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 09:58:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2024-10-11 09:58:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 200 states have (on average 1.405) internal successors, (281), 202 states have internal predecessors, (281), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:58:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 425 transitions. [2024-10-11 09:58:48,625 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 425 transitions. Word has length 136 [2024-10-11 09:58:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:48,626 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 425 transitions. [2024-10-11 09:58:48,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:58:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 425 transitions. [2024-10-11 09:58:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:58:48,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:48,628 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:58:48,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-11 09:58:48,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:58:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:49,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1050856632, now seen corresponding path program 1 times [2024-10-11 09:58:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:58:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075130333] [2024-10-11 09:58:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:49,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:58:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:58:49,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:58:49,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 09:58:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:49,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:58:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-10-11 09:58:50,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:58:51,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:58:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075130333] [2024-10-11 09:58:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075130333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:58:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1943578595] [2024-10-11 09:58:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:51,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:58:51,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:58:51,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:58:51,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 09:58:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:52,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:58:52,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:58:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-11 09:58:52,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:58:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1943578595] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:58:53,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:58:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2024-10-11 09:58:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881999786] [2024-10-11 09:58:53,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:58:53,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 09:58:53,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:58:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 09:58:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:58:53,270 INFO L87 Difference]: Start difference. First operand 278 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 09:58:57,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:58:59,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:02,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:04,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:06,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:10,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:10,481 INFO L93 Difference]: Finished difference Result 680 states and 1020 transitions. [2024-10-11 09:59:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 09:59:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 136 [2024-10-11 09:59:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:10,488 INFO L225 Difference]: With dead ends: 680 [2024-10-11 09:59:10,488 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 09:59:10,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 404 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2024-10-11 09:59:10,499 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 136 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:10,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 579 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2024-10-11 09:59:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 09:59:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 432. [2024-10-11 09:59:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 301 states have (on average 1.3521594684385383) internal successors, (407), 307 states have internal predecessors, (407), 118 states have call successors, (118), 12 states have call predecessors, (118), 12 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-11 09:59:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 643 transitions. [2024-10-11 09:59:10,527 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 643 transitions. Word has length 136 [2024-10-11 09:59:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:10,528 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 643 transitions. [2024-10-11 09:59:10,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 09:59:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 643 transitions. [2024-10-11 09:59:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:59:10,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:10,530 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:59:10,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 09:59:10,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 09:59:10,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:59:10,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:10,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -537324654, now seen corresponding path program 1 times [2024-10-11 09:59:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103366417] [2024-10-11 09:59:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:10,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:59:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:10,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:59:10,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 09:59:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:11,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 09:59:11,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:59:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 09:59:13,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:59:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:59:14,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:59:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103366417] [2024-10-11 09:59:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103366417] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:59:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:59:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-10-11 09:59:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971891691] [2024-10-11 09:59:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:59:14,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:59:14,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:59:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:59:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:59:14,095 INFO L87 Difference]: Start difference. First operand 432 states and 643 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:59:17,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:21,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:22,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:59:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:59:22,627 INFO L93 Difference]: Finished difference Result 926 states and 1380 transitions. [2024-10-11 09:59:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:59:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-11 09:59:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:59:22,641 INFO L225 Difference]: With dead ends: 926 [2024-10-11 09:59:22,641 INFO L226 Difference]: Without dead ends: 588 [2024-10-11 09:59:22,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:59:22,645 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 27 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:59:22,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 234 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-10-11 09:59:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-11 09:59:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 450. [2024-10-11 09:59:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 319 states have (on average 1.341692789968652) internal successors, (428), 325 states have internal predecessors, (428), 118 states have call successors, (118), 12 states have call predecessors, (118), 12 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-11 09:59:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 664 transitions. [2024-10-11 09:59:22,695 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 664 transitions. Word has length 137 [2024-10-11 09:59:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:59:22,696 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 664 transitions. [2024-10-11 09:59:22,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 09:59:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 664 transitions. [2024-10-11 09:59:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:59:22,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:59:22,698 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:59:22,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 09:59:22,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:59:22,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:59:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:59:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash -930351664, now seen corresponding path program 1 times [2024-10-11 09:59:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:59:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133484986] [2024-10-11 09:59:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:59:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:59:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:59:22,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:59:22,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 09:59:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:59:23,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 09:59:23,248 INFO L278 TraceCheckSpWp]: Computing forward predicates...