./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_floatingpointinfluence_no-floats_file-83.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_floatingpointinfluence_no-floats_file-83.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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:00:08,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:00:08,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:00:08,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:00:08,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:00:08,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:00:08,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:00:08,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:00:08,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:00:08,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:00:08,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:00:08,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:00:08,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:00:08,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:00:08,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:00:08,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:00:08,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:00:08,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:00:08,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:00:08,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:00:08,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:00:08,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:00:08,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:00:08,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:00:08,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:00:08,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:00:08,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:00:08,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:00:08,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:00:08,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:00:08,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:00:08,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:00:08,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:08,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:00:08,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:00:08,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:00:08,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:00:08,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:00:08,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:00:08,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:00:08,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:00:08,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:00:08,885 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2024-10-11 11:00:09,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:00:09,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:00:09,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:00:09,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:00:09,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:00:09,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:10,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:00:10,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:00:10,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:10,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06c3b59ea/7b7eec2dd071447688d6f69e9c3e1d15/FLAG886cbcb38 [2024-10-11 11:00:10,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/06c3b59ea/7b7eec2dd071447688d6f69e9c3e1d15 [2024-10-11 11:00:10,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:00:10,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:00:10,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:10,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:00:10,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:00:10,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:10" (1/1) ... [2024-10-11 11:00:10,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a818ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:10, skipping insertion in model container [2024-10-11 11:00:10,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:10" (1/1) ... [2024-10-11 11:00:11,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:00:11,141 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_floatingpointinfluence_no-floats_file-83.i[916,929] [2024-10-11 11:00:11,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:11,177 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:00:11,190 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_floatingpointinfluence_no-floats_file-83.i[916,929] [2024-10-11 11:00:11,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:11,222 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:00:11,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11 WrapperNode [2024-10-11 11:00:11,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:11,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:11,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:00:11,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:00:11,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,271 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-11 11:00:11,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:11,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:00:11,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:00:11,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:00:11,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,299 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 11:00:11,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:00:11,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:00:11,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:00:11,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:00:11,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (1/1) ... [2024-10-11 11:00:11,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:00:11,351 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 11:00:11,354 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 11:00:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:00:11,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:00:11,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:00:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:00:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:00:11,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:00:11,456 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:00:11,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:00:11,688 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:00:11,688 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:00:11,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:00:11,740 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:00:11,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:11 BoogieIcfgContainer [2024-10-11 11:00:11,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:00:11,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:00:11,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:00:11,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:00:11,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:00:10" (1/3) ... [2024-10-11 11:00:11,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0528fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:11, skipping insertion in model container [2024-10-11 11:00:11,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:11" (2/3) ... [2024-10-11 11:00:11,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0528fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:11, skipping insertion in model container [2024-10-11 11:00:11,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:11" (3/3) ... [2024-10-11 11:00:11,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:11,782 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:00:11,783 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:00:11,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:00:11,838 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;@ff9f24d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:00:11,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:00:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:00:11,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:11,853 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:11,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1910925419, now seen corresponding path program 1 times [2024-10-11 11:00:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948343396] [2024-10-11 11:00:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948343396] [2024-10-11 11:00:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948343396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:00:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582283460] [2024-10-11 11:00:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:12,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:00:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:00:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:00:12,164 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:12,198 INFO L93 Difference]: Finished difference Result 101 states and 171 transitions. [2024-10-11 11:00:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:00:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2024-10-11 11:00:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:12,210 INFO L225 Difference]: With dead ends: 101 [2024-10-11 11:00:12,210 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 11:00:12,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 11:00:12,217 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:12,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 11:00:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 11:00:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-11 11:00:12,267 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 84 [2024-10-11 11:00:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-11 11:00:12,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-11 11:00:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 11:00:12,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:12,274 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:00:12,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 108396519, now seen corresponding path program 1 times [2024-10-11 11:00:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025784203] [2024-10-11 11:00:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025784203] [2024-10-11 11:00:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025784203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:00:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022399364] [2024-10-11 11:00:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:00:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:12,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:00:12,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:12,484 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:12,528 INFO L93 Difference]: Finished difference Result 123 states and 183 transitions. [2024-10-11 11:00:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:00:12,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-11 11:00:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:12,533 INFO L225 Difference]: With dead ends: 123 [2024-10-11 11:00:12,533 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 11:00:12,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:12,536 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:12,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 128 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 11:00:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2024-10-11 11:00:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-10-11 11:00:12,550 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 84 [2024-10-11 11:00:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:12,552 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-10-11 11:00:12,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-10-11 11:00:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 11:00:12,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:12,555 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:12,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:00:12,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:12,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 754112006, now seen corresponding path program 1 times [2024-10-11 11:00:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579453264] [2024-10-11 11:00:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:12,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579453264] [2024-10-11 11:00:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579453264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:12,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:00:12,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140489542] [2024-10-11 11:00:12,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:12,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:00:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:12,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:00:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:00:12,747 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:12,806 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2024-10-11 11:00:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:00:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2024-10-11 11:00:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:12,808 INFO L225 Difference]: With dead ends: 101 [2024-10-11 11:00:12,808 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:00:12,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:12,809 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:12,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:00:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:00:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-11 11:00:12,821 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 85 [2024-10-11 11:00:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-11 11:00:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-11 11:00:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 11:00:12,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:12,823 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:00:12,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:12,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash -414280213, now seen corresponding path program 1 times [2024-10-11 11:00:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593939134] [2024-10-11 11:00:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593939134] [2024-10-11 11:00:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593939134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:00:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695162126] [2024-10-11 11:00:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:14,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:00:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:00:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:14,617 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:15,013 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2024-10-11 11:00:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:00:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-10-11 11:00:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:15,015 INFO L225 Difference]: With dead ends: 133 [2024-10-11 11:00:15,016 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 11:00:15,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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 11:00:15,017 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 91 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:15,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 159 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:00:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 11:00:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2024-10-11 11:00:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 53 states have internal predecessors, (68), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-11 11:00:15,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 86 [2024-10-11 11:00:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:15,029 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-11 11:00:15,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-11 11:00:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 11:00:15,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:15,031 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:15,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:00:15,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:15,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1554915556, now seen corresponding path program 1 times [2024-10-11 11:00:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:15,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626974737] [2024-10-11 11:00:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626974737] [2024-10-11 11:00:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626974737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:00:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088141124] [2024-10-11 11:00:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:00:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:00:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:00:15,661 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:16,001 INFO L93 Difference]: Finished difference Result 163 states and 221 transitions. [2024-10-11 11:00:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:00:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-10-11 11:00:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:16,002 INFO L225 Difference]: With dead ends: 163 [2024-10-11 11:00:16,002 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 11:00:16,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:00:16,004 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:16,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 269 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:00:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 11:00:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2024-10-11 11:00:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 53 states have internal predecessors, (68), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-11 11:00:16,015 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 87 [2024-10-11 11:00:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:16,016 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-11 11:00:16,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-11 11:00:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 11:00:16,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:16,017 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:16,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:00:16,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash 968109542, now seen corresponding path program 1 times [2024-10-11 11:00:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023046676] [2024-10-11 11:00:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:17,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023046676] [2024-10-11 11:00:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023046676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:00:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136808815] [2024-10-11 11:00:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:17,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:00:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:00:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:00:17,707 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:18,330 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2024-10-11 11:00:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:00:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-10-11 11:00:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:18,333 INFO L225 Difference]: With dead ends: 162 [2024-10-11 11:00:18,333 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:00:18,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:00:18,334 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 121 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:18,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 301 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:00:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:00:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2024-10-11 11:00:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-11 11:00:18,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 87 [2024-10-11 11:00:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:18,341 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-11 11:00:18,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-11 11:00:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 11:00:18,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:18,342 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:00:18,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 475443620, now seen corresponding path program 1 times [2024-10-11 11:00:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328969258] [2024-10-11 11:00:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328969258] [2024-10-11 11:00:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328969258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:00:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979987403] [2024-10-11 11:00:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:00:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:00:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:18,426 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:18,482 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2024-10-11 11:00:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:00:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-10-11 11:00:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:18,484 INFO L225 Difference]: With dead ends: 130 [2024-10-11 11:00:18,484 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 11:00:18,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:18,486 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:18,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 11:00:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2024-10-11 11:00:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-10-11 11:00:18,501 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 88 [2024-10-11 11:00:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:18,501 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-10-11 11:00:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-10-11 11:00:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 11:00:18,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:18,502 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:18,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:00:18,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1270634053, now seen corresponding path program 1 times [2024-10-11 11:00:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423964927] [2024-10-11 11:00:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423964927] [2024-10-11 11:00:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423964927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:18,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:00:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57777415] [2024-10-11 11:00:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:18,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:00:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:18,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:00:18,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:00:18,599 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:18,682 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-10-11 11:00:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:00:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 11:00:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:18,684 INFO L225 Difference]: With dead ends: 149 [2024-10-11 11:00:18,685 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 11:00:18,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:18,686 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 102 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:18,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 108 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:00:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 11:00:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2024-10-11 11:00:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-10-11 11:00:18,700 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 88 [2024-10-11 11:00:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-10-11 11:00:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-10-11 11:00:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 11:00:18,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:18,702 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:00:18,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2101782526, now seen corresponding path program 1 times [2024-10-11 11:00:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879136626] [2024-10-11 11:00:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879136626] [2024-10-11 11:00:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879136626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:00:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434613386] [2024-10-11 11:00:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:00:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:18,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:00:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:00:18,869 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:19,056 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-10-11 11:00:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:00:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-10-11 11:00:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:19,057 INFO L225 Difference]: With dead ends: 119 [2024-10-11 11:00:19,057 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 11:00:19,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:00:19,058 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:19,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 299 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:00:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 11:00:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2024-10-11 11:00:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:00:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-10-11 11:00:19,078 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 89 [2024-10-11 11:00:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:19,078 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-10-11 11:00:19,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-10-11 11:00:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 11:00:19,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:19,079 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:19,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:00:19,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1028182273, now seen corresponding path program 1 times [2024-10-11 11:00:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850787884] [2024-10-11 11:00:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850787884] [2024-10-11 11:00:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850787884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:00:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833247607] [2024-10-11 11:00:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:00:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:00:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:00:19,154 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:19,222 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2024-10-11 11:00:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:00:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-11 11:00:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:19,225 INFO L225 Difference]: With dead ends: 166 [2024-10-11 11:00:19,225 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 11:00:19,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:19,226 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:19,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 11:00:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2024-10-11 11:00:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:00:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-10-11 11:00:19,239 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 90 [2024-10-11 11:00:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:19,240 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-10-11 11:00:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-10-11 11:00:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 11:00:19,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:19,241 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:19,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:00:19,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1482026565, now seen corresponding path program 1 times [2024-10-11 11:00:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800748656] [2024-10-11 11:00:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800748656] [2024-10-11 11:00:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800748656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:00:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880601816] [2024-10-11 11:00:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:19,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:00:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:00:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:00:19,662 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:20,013 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2024-10-11 11:00:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:00:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-11 11:00:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:20,015 INFO L225 Difference]: With dead ends: 123 [2024-10-11 11:00:20,015 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 11:00:20,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:00:20,015 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:20,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 322 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:00:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 11:00:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2024-10-11 11:00:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:00:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2024-10-11 11:00:20,026 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 91 [2024-10-11 11:00:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2024-10-11 11:00:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-10-11 11:00:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 11:00:20,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:20,028 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:20,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 11:00:20,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1223861127, now seen corresponding path program 1 times [2024-10-11 11:00:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439850164] [2024-10-11 11:00:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439850164] [2024-10-11 11:00:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439850164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:00:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000133445] [2024-10-11 11:00:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:00:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:00:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:00:20,358 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:20,724 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2024-10-11 11:00:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:00:20,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-11 11:00:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:20,725 INFO L225 Difference]: With dead ends: 130 [2024-10-11 11:00:20,725 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 11:00:20,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:00:20,726 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 84 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:20,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 414 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:00:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 11:00:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 89. [2024-10-11 11:00:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:00:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2024-10-11 11:00:20,738 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 91 [2024-10-11 11:00:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:20,739 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2024-10-11 11:00:20,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-10-11 11:00:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:00:20,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:20,740 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:20,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 11:00:20,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:20,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1504208541, now seen corresponding path program 1 times [2024-10-11 11:00:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015196043] [2024-10-11 11:00:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015196043] [2024-10-11 11:00:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015196043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:20,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:20,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:00:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459092976] [2024-10-11 11:00:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:20,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:00:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:00:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:20,776 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:20,815 INFO L93 Difference]: Finished difference Result 199 states and 253 transitions. [2024-10-11 11:00:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:00:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:00:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:20,816 INFO L225 Difference]: With dead ends: 199 [2024-10-11 11:00:20,816 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 11:00:20,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:20,817 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:20,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 115 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 11:00:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-10-11 11:00:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.108433734939759) internal successors, (92), 85 states have internal predecessors, (92), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:00:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2024-10-11 11:00:20,835 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 92 [2024-10-11 11:00:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:20,835 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2024-10-11 11:00:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2024-10-11 11:00:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:00:20,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:20,836 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:20,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 11:00:20,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:20,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2004109448, now seen corresponding path program 1 times [2024-10-11 11:00:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:20,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628797875] [2024-10-11 11:00:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628797875] [2024-10-11 11:00:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628797875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:20,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:20,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:00:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266960163] [2024-10-11 11:00:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:20,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:00:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:00:20,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:20,879 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:20,929 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2024-10-11 11:00:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:00:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-11 11:00:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:20,930 INFO L225 Difference]: With dead ends: 234 [2024-10-11 11:00:20,930 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 11:00:20,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:00:20,932 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:20,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 150 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 11:00:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-10-11 11:00:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 85 states have internal predecessors, (91), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:00:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2024-10-11 11:00:20,949 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 93 [2024-10-11 11:00:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:20,950 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2024-10-11 11:00:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2024-10-11 11:00:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:00:20,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:20,951 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:20,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 11:00:20,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:20,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1270326310, now seen corresponding path program 1 times [2024-10-11 11:00:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169529857] [2024-10-11 11:00:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:00:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:00:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:00:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:00:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:00:21,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169529857] [2024-10-11 11:00:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169529857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:21,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:00:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589646232] [2024-10-11 11:00:21,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:21,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:00:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:21,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:00:21,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:00:21,003 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:21,068 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2024-10-11 11:00:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:00:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-11 11:00:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:21,070 INFO L225 Difference]: With dead ends: 242 [2024-10-11 11:00:21,070 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 11:00:21,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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 11:00:21,072 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:21,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 166 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 11:00:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2024-10-11 11:00:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 85 states have internal predecessors, (90), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:00:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 156 transitions. [2024-10-11 11:00:21,091 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 156 transitions. Word has length 94 [2024-10-11 11:00:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:21,092 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 156 transitions. [2024-10-11 11:00:21,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:00:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2024-10-11 11:00:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 11:00:21,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:21,093 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:21,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 11:00:21,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:21,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1278760389, now seen corresponding path program 1 times [2024-10-11 11:00:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660205735] [2024-10-11 11:00:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:00:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743268383] [2024-10-11 11:00:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:00:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:00:21,121 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 11:00:21,122 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 11:00:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:00:21,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:00:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:00:21,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:00:21,284 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:00:21,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:00:21,305 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 11:00:21,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 11:00:21,495 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:21,549 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:00:21,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:00:21 BoogieIcfgContainer [2024-10-11 11:00:21,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:00:21,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:00:21,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:00:21,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:00:21,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:11" (3/4) ... [2024-10-11 11:00:21,555 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:00:21,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:00:21,556 INFO L158 Benchmark]: Toolchain (without parser) took 10568.00ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 113.8MB in the beginning and 173.1MB in the end (delta: -59.3MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,556 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:00:21,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.18ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 99.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,556 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 174.1MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,556 INFO L158 Benchmark]: RCFGBuilder took 427.90ms. Allocated memory is still 174.1MB. Free memory was 91.7MB in the beginning and 140.9MB in the end (delta: -49.2MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,557 INFO L158 Benchmark]: TraceAbstraction took 9810.25ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 140.2MB in the beginning and 174.2MB in the end (delta: -34.0MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2024-10-11 11:00:21,557 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 318.8MB. Free memory was 174.2MB in the beginning and 173.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:00:21,558 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.14ms. Allocated memory is still 174.1MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.18ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 99.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 174.1MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 174.1MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.90ms. Allocated memory is still 174.1MB. Free memory was 91.7MB in the beginning and 140.9MB in the end (delta: -49.2MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9810.25ms. Allocated memory was 174.1MB in the beginning and 318.8MB in the end (delta: 144.7MB). Free memory was 140.2MB in the beginning and 174.2MB in the end (delta: -34.0MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 318.8MB. Free memory was 174.2MB in the beginning and 173.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] signed long int var_1_8 = 127; [L27] signed long int var_1_10 = 0; [L28] signed long int var_1_11 = 128; [L29] signed long int var_1_12 = 24; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] signed long int var_1_17 = 1; [L34] unsigned short int last_1_var_1_1 = 128; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_1 = var_1_1 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=127] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=127] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=127] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=127] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=127] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=0, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L78] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L79] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L79] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=128, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L83] var_1_16 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L84] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L85] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L85] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L99] RET updateVariables() [L100] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=2, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=2, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND TRUE var_1_15 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=127] [L54] COND TRUE var_1_1 == stepLocal_1 [L55] var_1_8 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L91] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L91] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L91] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L91-L92] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((signed long int) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((signed long int) var_1_11))) : (var_1_8 == ((signed long int) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((signed long int) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((signed long int) var_1_10)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=1, var_1_11=-1, var_1_12=24, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 16, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 829 mSDsluCounter, 2918 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1817 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1930 IncrementalHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1101 mSDtfsCounter, 1930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=13, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 270 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1519 NumberOfCodeBlocks, 1519 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 5480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4680/4680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:00:21,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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_floatingpointinfluence_no-floats_file-83.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 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:00:23,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:00:23,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:00:23,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:00:23,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:00:23,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:00:23,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:00:23,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:00:23,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:00:23,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:00:23,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:00:23,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:00:23,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:00:23,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:00:23,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:00:23,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:00:23,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:00:23,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:00:23,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:00:23,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:00:23,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:00:23,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:00:23,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:00:23,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:00:23,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:00:23,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:00:23,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:00:23,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:00:23,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:00:23,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:23,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:00:23,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:00:23,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:00:23,548 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:00:23,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:00:23,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:00:23,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:00:23,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:00:23,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:00:23,549 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:00:23,549 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 -> 9f9164e1a34b1b6bc15e6d6c10636cd9af69b42bd441271521d7273f80c38ea6 [2024-10-11 11:00:23,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:00:23,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:00:23,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:00:23,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:00:23,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:00:23,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:25,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:00:25,322 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:00:25,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:25,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4e5fe938/b3b31de662f44dc7af18e35cfb83e4a1/FLAG696107a90 [2024-10-11 11:00:25,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4e5fe938/b3b31de662f44dc7af18e35cfb83e4a1 [2024-10-11 11:00:25,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:00:25,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:00:25,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:25,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:00:25,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:00:25,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53eb735f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25, skipping insertion in model container [2024-10-11 11:00:25,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:00:25,538 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_floatingpointinfluence_no-floats_file-83.i[916,929] [2024-10-11 11:00:25,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:25,600 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:00:25,611 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_floatingpointinfluence_no-floats_file-83.i[916,929] [2024-10-11 11:00:25,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:25,659 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:00:25,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25 WrapperNode [2024-10-11 11:00:25,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:25,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:25,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:00:25,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:00:25,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,700 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-10-11 11:00:25,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:25,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:00:25,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:00:25,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:00:25,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,738 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 11:00:25,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:00:25,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:00:25,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:00:25,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:00:25,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (1/1) ... [2024-10-11 11:00:25,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:25,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:00:25,794 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 11:00:25,796 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 11:00:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:00:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:00:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:00:25,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:00:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:00:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:00:25,912 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:00:25,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:00:26,132 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 11:00:26,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:00:26,187 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:00:26,187 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:00:26,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:26 BoogieIcfgContainer [2024-10-11 11:00:26,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:00:26,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:00:26,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:00:26,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:00:26,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:00:25" (1/3) ... [2024-10-11 11:00:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad36edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:26, skipping insertion in model container [2024-10-11 11:00:26,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:25" (2/3) ... [2024-10-11 11:00:26,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad36edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:26, skipping insertion in model container [2024-10-11 11:00:26,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:26" (3/3) ... [2024-10-11 11:00:26,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-83.i [2024-10-11 11:00:26,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:00:26,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:00:26,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:00:26,282 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;@1734dc6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:00:26,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:00:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 11:00:26,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:26,296 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:26,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1821911543, now seen corresponding path program 1 times [2024-10-11 11:00:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:00:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474573495] [2024-10-11 11:00:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:26,315 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 11:00:26,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:00:26,317 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 11:00:26,318 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 11:00:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:00:26,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:00:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-11 11:00:26,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:00:26,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:00:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474573495] [2024-10-11 11:00:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474573495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:00:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088152179] [2024-10-11 11:00:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:00:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:00:26,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:00:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:00:26,515 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:26,555 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2024-10-11 11:00:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:00:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 80 [2024-10-11 11:00:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:26,566 INFO L225 Difference]: With dead ends: 73 [2024-10-11 11:00:26,566 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:00:26,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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 11:00:26,573 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:00:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:00:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:00:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-11 11:00:26,613 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 80 [2024-10-11 11:00:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-11 11:00:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:00:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-11 11:00:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 11:00:26,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:26,619 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:26,627 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 11:00:26,823 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 11:00:26,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:26,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1119280949, now seen corresponding path program 1 times [2024-10-11 11:00:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:00:26,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790077017] [2024-10-11 11:00:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:26,828 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 11:00:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:00:26,833 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 11:00:26,834 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 11:00:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:26,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 11:00:26,940 INFO L278 TraceCheckSpWp]: Computing forward predicates...