./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-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 382355403b61348faa15550ce62d0e27cb87c437f54bc87fc7019d7fcdc73f1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:37:40,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:37:40,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:37:40,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:37:40,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:37:40,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:37:40,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:37:40,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:37:40,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:37:40,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:37:40,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:37:40,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:37:40,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:37:40,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:37:40,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:37:40,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:37:40,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:37:40,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:37:40,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:37:40,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:37:40,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:37:40,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:37:40,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:37:40,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:37:40,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:37:40,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:37:40,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:37:40,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:37:40,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:37:40,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:37:40,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:37:40,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:37:40,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:37:40,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:37:40,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:37:40,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:37:40,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:37:40,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:37:40,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:37:40,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:37:40,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:37:40,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:37:40,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 382355403b61348faa15550ce62d0e27cb87c437f54bc87fc7019d7fcdc73f1f [2024-10-13 03:37:40,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:37:40,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:37:40,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:37:40,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:37:40,578 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:37:40,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-5.i [2024-10-13 03:37:41,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:37:42,114 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:37:42,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-5.i [2024-10-13 03:37:42,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e42a12f/3d70a527ed00433e809f69bd7ea558b9/FLAGe51e90642 [2024-10-13 03:37:42,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e42a12f/3d70a527ed00433e809f69bd7ea558b9 [2024-10-13 03:37:42,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:37:42,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:37:42,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:37:42,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:37:42,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:37:42,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5c407d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42, skipping insertion in model container [2024-10-13 03:37:42,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:37:42,316 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-5.i[915,928] [2024-10-13 03:37:42,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:37:42,383 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:37:42,396 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-5.i[915,928] [2024-10-13 03:37:42,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:37:42,448 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:37:42,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42 WrapperNode [2024-10-13 03:37:42,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:37:42,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:37:42,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:37:42,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:37:42,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,503 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-13 03:37:42,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:37:42,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:37:42,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:37:42,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:37:42,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:37:42,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:37:42,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:37:42,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:37:42,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:37:42,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (1/1) ... [2024-10-13 03:37:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:37:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:37:42,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:37:42,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:37:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:37:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:37:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:37:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:37:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:37:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:37:42,760 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:37:42,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:37:43,054 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:37:43,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:37:43,101 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:37:43,101 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:37:43,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:43 BoogieIcfgContainer [2024-10-13 03:37:43,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:37:43,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:37:43,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:37:43,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:37:43,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:37:42" (1/3) ... [2024-10-13 03:37:43,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3487e041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:37:43, skipping insertion in model container [2024-10-13 03:37:43,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:42" (2/3) ... [2024-10-13 03:37:43,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3487e041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:37:43, skipping insertion in model container [2024-10-13 03:37:43,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:43" (3/3) ... [2024-10-13 03:37:43,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-5.i [2024-10-13 03:37:43,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:37:43,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:37:43,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:37:43,184 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;@313c7a79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:37:43,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:37:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:37:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 03:37:43,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:43,206 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:37:43,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2049795029, now seen corresponding path program 1 times [2024-10-13 03:37:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168974159] [2024-10-13 03:37:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:37:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:37:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:37:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:37:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:37:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 03:37:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:37:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 03:37:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:37:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:37:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:37:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168974159] [2024-10-13 03:37:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168974159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:37:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818119091] [2024-10-13 03:37:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:37:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:43,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:37:43,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:37:43,558 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:37:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:43,600 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2024-10-13 03:37:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:37:43,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 118 [2024-10-13 03:37:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:43,610 INFO L225 Difference]: With dead ends: 93 [2024-10-13 03:37:43,611 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 03:37:43,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:37:43,620 INFO L432 NwaCegarLoop]: 67 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, 67 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-13 03:37:43,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:37:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 03:37:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 03:37:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:37:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-13 03:37:43,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 118 [2024-10-13 03:37:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:43,675 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-13 03:37:43,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:37:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-13 03:37:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 03:37:43,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:43,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:37:43,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:37:43,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:43,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1084733081, now seen corresponding path program 1 times [2024-10-13 03:37:43,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657887047] [2024-10-13 03:37:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:37:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:37:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:37:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:37:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:37:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 03:37:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:37:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 03:37:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:37:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:37:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:37:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657887047] [2024-10-13 03:37:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657887047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:37:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079277732] [2024-10-13 03:37:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:46,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:37:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:37:46,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:37:46,207 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:46,772 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2024-10-13 03:37:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:37:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 118 [2024-10-13 03:37:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:46,776 INFO L225 Difference]: With dead ends: 84 [2024-10-13 03:37:46,776 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 03:37:46,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:37:46,778 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 63 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:46,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 244 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:37:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 03:37:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 54. [2024-10-13 03:37:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:37:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-13 03:37:46,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 118 [2024-10-13 03:37:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-13 03:37:46,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-13 03:37:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 03:37:46,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:46,806 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:37:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:37:46,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1084792663, now seen corresponding path program 1 times [2024-10-13 03:37:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510343903] [2024-10-13 03:37:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:37:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:37:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:37:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:37:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:37:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 03:37:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:37:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 03:37:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:37:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:37:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:37:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510343903] [2024-10-13 03:37:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510343903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:37:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739463460] [2024-10-13 03:37:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:46,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:37:46,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:37:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:37:46,927 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:46,955 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2024-10-13 03:37:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:37:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 118 [2024-10-13 03:37:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:46,959 INFO L225 Difference]: With dead ends: 107 [2024-10-13 03:37:46,959 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 03:37:46,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 03:37:46,961 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:46,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:37:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 03:37:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 03:37:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:37:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-10-13 03:37:46,980 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 118 [2024-10-13 03:37:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-10-13 03:37:46,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-10-13 03:37:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 03:37:46,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:46,984 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:37:46,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:37:46,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:46,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1141991383, now seen corresponding path program 1 times [2024-10-13 03:37:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036487092] [2024-10-13 03:37:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:37:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:37:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:37:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:37:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:37:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 03:37:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:37:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 03:37:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:37:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:37:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:37:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036487092] [2024-10-13 03:37:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036487092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:37:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661505626] [2024-10-13 03:37:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:37:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:37:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:37:47,874 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:48,439 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2024-10-13 03:37:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:37:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 118 [2024-10-13 03:37:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:48,443 INFO L225 Difference]: With dead ends: 77 [2024-10-13 03:37:48,443 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 03:37:48,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:37:48,444 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:48,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 201 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:37:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 03:37:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 03:37:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 03:37:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 03:37:48,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2024-10-13 03:37:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 03:37:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:37:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 03:37:48,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 03:37:48,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:37:48,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:37:48,458 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 03:37:48,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 03:37:48,661 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:37:48,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:37:48 BoogieIcfgContainer [2024-10-13 03:37:48,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:37:48,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:37:48,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:37:48,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:37:48,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:43" (3/4) ... [2024-10-13 03:37:48,679 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 03:37:48,682 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 03:37:48,689 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 03:37:48,689 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 03:37:48,689 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 03:37:48,689 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 03:37:48,767 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 03:37:48,768 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 03:37:48,768 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:37:48,769 INFO L158 Benchmark]: Toolchain (without parser) took 6621.05ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 118.5MB in the beginning and 93.2MB in the end (delta: 25.3MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,769 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:37:48,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.95ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 103.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.99ms. Allocated memory is still 153.1MB. Free memory was 103.8MB in the beginning and 100.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,769 INFO L158 Benchmark]: Boogie Preprocessor took 58.57ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 94.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,770 INFO L158 Benchmark]: RCFGBuilder took 538.75ms. Allocated memory is still 153.1MB. Free memory was 94.7MB in the beginning and 107.8MB in the end (delta: -13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,770 INFO L158 Benchmark]: TraceAbstraction took 5572.37ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 106.8MB in the beginning and 99.5MB in the end (delta: 7.4MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,770 INFO L158 Benchmark]: Witness Printer took 91.77ms. Allocated memory is still 247.5MB. Free memory was 99.5MB in the beginning and 93.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:37:48,771 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.15ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.95ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 103.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.99ms. Allocated memory is still 153.1MB. Free memory was 103.8MB in the beginning and 100.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.57ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 94.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 538.75ms. Allocated memory is still 153.1MB. Free memory was 94.7MB in the beginning and 107.8MB in the end (delta: -13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5572.37ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 106.8MB in the beginning and 99.5MB in the end (delta: 7.4MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 91.77ms. Allocated memory is still 247.5MB. Free memory was 99.5MB in the beginning and 93.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 640 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 287 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((var_1_9 == 0) || (var_1_8 == var_1_12)) RESULT: Ultimate proved your program to be correct! [2024-10-13 03:37:48,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: TRUE