./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-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-18.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 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:01:16,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:01:17,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:01:17,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:01:17,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:01:17,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:01:17,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:01:17,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:01:17,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:01:17,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:01:17,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:01:17,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:01:17,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:01:17,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:01:17,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:01:17,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:01:17,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:01:17,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:01:17,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:01:17,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:01:17,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:01:17,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:01:17,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:01:17,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:01:17,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:01:17,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:01:17,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:01:17,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:01:17,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:01:17,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:01:17,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:01:17,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:01:17,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:01:17,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:01:17,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:01:17,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:01:17,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:01:17,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:01:17,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:01:17,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:01:17,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:01:17,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:01:17,120 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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-10-14 11:01:17,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:01:17,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:01:17,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:01:17,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:01:17,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:01:17,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:18,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:01:19,125 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:01:19,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:19,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca588a85/5ea197127bf54501ac78c910aa4cf83a/FLAGb8617aece [2024-10-14 11:01:19,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca588a85/5ea197127bf54501ac78c910aa4cf83a [2024-10-14 11:01:19,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:01:19,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:01:19,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:01:19,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:01:19,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:01:19,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b770480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19, skipping insertion in model container [2024-10-14 11:01:19,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:01:19,335 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-18.i[916,929] [2024-10-14 11:01:19,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:01:19,387 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:01:19,403 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-18.i[916,929] [2024-10-14 11:01:19,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:01:19,445 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:01:19,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19 WrapperNode [2024-10-14 11:01:19,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:01:19,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:01:19,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:01:19,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:01:19,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,494 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-14 11:01:19,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:01:19,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:01:19,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:01:19,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:01:19,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,545 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-14 11:01:19,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:01:19,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:01:19,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:01:19,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:01:19,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (1/1) ... [2024-10-14 11:01:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:01:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:01:19,610 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-14 11:01:19,617 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-14 11:01:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:01:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:01:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:01:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:01:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:01:19,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:01:19,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:01:19,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:01:20,068 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 11:01:20,068 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:01:20,106 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:01:20,107 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:01:20,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:01:20 BoogieIcfgContainer [2024-10-14 11:01:20,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:01:20,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:01:20,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:01:20,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:01:20,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:01:19" (1/3) ... [2024-10-14 11:01:20,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecc4816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:01:20, skipping insertion in model container [2024-10-14 11:01:20,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:19" (2/3) ... [2024-10-14 11:01:20,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecc4816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:01:20, skipping insertion in model container [2024-10-14 11:01:20,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:01:20" (3/3) ... [2024-10-14 11:01:20,120 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:20,138 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:01:20,138 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:01:20,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:01:20,202 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;@7b69355b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:01:20,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:01:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:01:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:01:20,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:20,220 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:20,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1144362047, now seen corresponding path program 1 times [2024-10-14 11:01:20,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:20,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482761586] [2024-10-14 11:01:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482761586] [2024-10-14 11:01:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482761586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:01:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147427146] [2024-10-14 11:01:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:20,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:01:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:01:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:01:20,633 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:01:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:20,677 INFO L93 Difference]: Finished difference Result 117 states and 198 transitions. [2024-10-14 11:01:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:01:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-10-14 11:01:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:20,691 INFO L225 Difference]: With dead ends: 117 [2024-10-14 11:01:20,691 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 11:01:20,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-14 11:01:20,702 INFO L432 NwaCegarLoop]: 85 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, 85 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-14 11:01:20,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:01:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 11:01:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 11:01:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:01:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2024-10-14 11:01:20,753 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 93 [2024-10-14 11:01:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2024-10-14 11:01:20,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:01:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2024-10-14 11:01:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 11:01:20,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:20,758 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:20,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:01:20,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash 358189697, now seen corresponding path program 1 times [2024-10-14 11:01:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009267307] [2024-10-14 11:01:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009267307] [2024-10-14 11:01:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009267307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:01:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014252484] [2024-10-14 11:01:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:01:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:01:21,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:01:21,262 INFO L87 Difference]: Start difference. First operand 58 states and 88 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:21,441 INFO L93 Difference]: Finished difference Result 172 states and 262 transitions. [2024-10-14 11:01:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:01:21,442 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-14 11:01:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:21,446 INFO L225 Difference]: With dead ends: 172 [2024-10-14 11:01:21,447 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 11:01:21,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-14 11:01:21,450 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 55 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:21,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 130 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:01:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 11:01:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-14 11:01:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 11:01:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2024-10-14 11:01:21,505 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 93 [2024-10-14 11:01:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:21,506 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2024-10-14 11:01:21,506 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2024-10-14 11:01:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 11:01:21,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:21,512 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:21,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:01:21,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash 763157850, now seen corresponding path program 1 times [2024-10-14 11:01:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156460018] [2024-10-14 11:01:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 11:01:22,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156460018] [2024-10-14 11:01:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156460018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:01:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887662695] [2024-10-14 11:01:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:22,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:01:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:01:22,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:01:22,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:01:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:22,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 11:01:22,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:01:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:01:22,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:01:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 11:01:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887662695] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:01:23,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:01:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-10-14 11:01:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622238107] [2024-10-14 11:01:23,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:01:23,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 11:01:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 11:01:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-14 11:01:23,282 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-14 11:01:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:24,336 INFO L93 Difference]: Finished difference Result 364 states and 531 transitions. [2024-10-14 11:01:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 11:01:24,336 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) Word has length 94 [2024-10-14 11:01:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:24,339 INFO L225 Difference]: With dead ends: 364 [2024-10-14 11:01:24,339 INFO L226 Difference]: Without dead ends: 253 [2024-10-14 11:01:24,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 11:01:24,342 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 302 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:24,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 299 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:01:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-14 11:01:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2024-10-14 11:01:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 178 states have (on average 1.2359550561797752) internal successors, (220), 178 states have internal predecessors, (220), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 11:01:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 332 transitions. [2024-10-14 11:01:24,397 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 332 transitions. Word has length 94 [2024-10-14 11:01:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 332 transitions. [2024-10-14 11:01:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-14 11:01:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 332 transitions. [2024-10-14 11:01:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 11:01:24,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:24,402 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:24,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:01:24,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:01:24,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:24,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash 523278988, now seen corresponding path program 1 times [2024-10-14 11:01:24,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:24,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400764798] [2024-10-14 11:01:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:29,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:29,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400764798] [2024-10-14 11:01:29,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400764798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:29,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 11:01:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174795719] [2024-10-14 11:01:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:29,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 11:01:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 11:01:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:01:29,936 INFO L87 Difference]: Start difference. First operand 243 states and 332 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:31,757 INFO L93 Difference]: Finished difference Result 641 states and 854 transitions. [2024-10-14 11:01:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 11:01:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-14 11:01:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:31,764 INFO L225 Difference]: With dead ends: 641 [2024-10-14 11:01:31,764 INFO L226 Difference]: Without dead ends: 399 [2024-10-14 11:01:31,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-14 11:01:31,767 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 356 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:31,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 388 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 11:01:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-14 11:01:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 255. [2024-10-14 11:01:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 190 states have (on average 1.2263157894736842) internal successors, (233), 190 states have internal predecessors, (233), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 11:01:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 345 transitions. [2024-10-14 11:01:31,806 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 345 transitions. Word has length 95 [2024-10-14 11:01:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:31,808 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 345 transitions. [2024-10-14 11:01:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2024-10-14 11:01:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 11:01:31,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:31,813 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:31,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:01:31,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:31,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash -756584690, now seen corresponding path program 1 times [2024-10-14 11:01:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:31,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854065540] [2024-10-14 11:01:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854065540] [2024-10-14 11:01:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854065540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 11:01:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557902856] [2024-10-14 11:01:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:35,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:01:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:35,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:01:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:01:35,813 INFO L87 Difference]: Start difference. First operand 255 states and 345 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:37,835 INFO L93 Difference]: Finished difference Result 460 states and 599 transitions. [2024-10-14 11:01:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 11:01:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-14 11:01:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:37,842 INFO L225 Difference]: With dead ends: 460 [2024-10-14 11:01:37,843 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 11:01:37,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-10-14 11:01:37,844 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 311 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:37,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 454 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 11:01:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 11:01:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 270. [2024-10-14 11:01:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 205 states have internal predecessors, (252), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 11:01:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2024-10-14 11:01:37,890 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 364 transitions. Word has length 95 [2024-10-14 11:01:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:37,890 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 364 transitions. [2024-10-14 11:01:37,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-10-14 11:01:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 11:01:37,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:37,892 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:37,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:01:37,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:37,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1142118825, now seen corresponding path program 1 times [2024-10-14 11:01:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22508658] [2024-10-14 11:01:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22508658] [2024-10-14 11:01:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22508658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:38,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:38,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:01:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113514295] [2024-10-14 11:01:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:01:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:01:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:01:38,012 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:38,049 INFO L93 Difference]: Finished difference Result 545 states and 739 transitions. [2024-10-14 11:01:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:01:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-10-14 11:01:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:38,053 INFO L225 Difference]: With dead ends: 545 [2024-10-14 11:01:38,053 INFO L226 Difference]: Without dead ends: 276 [2024-10-14 11:01:38,054 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-14 11:01:38,058 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:38,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:01:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-14 11:01:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2024-10-14 11:01:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 209 states have (on average 1.2248803827751196) internal successors, (256), 209 states have internal predecessors, (256), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 11:01:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 368 transitions. [2024-10-14 11:01:38,093 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 368 transitions. Word has length 96 [2024-10-14 11:01:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 368 transitions. [2024-10-14 11:01:38,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 368 transitions. [2024-10-14 11:01:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 11:01:38,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:38,097 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:38,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:01:38,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:38,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:38,098 INFO L85 PathProgramCache]: Analyzing trace with hash -138978991, now seen corresponding path program 1 times [2024-10-14 11:01:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379154772] [2024-10-14 11:01:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379154772] [2024-10-14 11:01:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379154772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:38,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:01:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411337083] [2024-10-14 11:01:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:01:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:01:38,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:01:38,714 INFO L87 Difference]: Start difference. First operand 274 states and 368 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:38,885 INFO L93 Difference]: Finished difference Result 332 states and 436 transitions. [2024-10-14 11:01:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:01:38,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-10-14 11:01:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:38,888 INFO L225 Difference]: With dead ends: 332 [2024-10-14 11:01:38,888 INFO L226 Difference]: Without dead ends: 330 [2024-10-14 11:01:38,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:01:38,889 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:38,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 285 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:01:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-14 11:01:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 318. [2024-10-14 11:01:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 253 states have (on average 1.2173913043478262) internal successors, (308), 253 states have internal predecessors, (308), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 11:01:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 420 transitions. [2024-10-14 11:01:38,934 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 420 transitions. Word has length 97 [2024-10-14 11:01:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:38,935 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 420 transitions. [2024-10-14 11:01:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 420 transitions. [2024-10-14 11:01:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 11:01:38,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:38,936 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:01:38,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 685445679, now seen corresponding path program 1 times [2024-10-14 11:01:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904007735] [2024-10-14 11:01:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:38,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904007735] [2024-10-14 11:01:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904007735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:39,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:39,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:01:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908058141] [2024-10-14 11:01:39,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:39,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:01:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:01:39,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:01:39,014 INFO L87 Difference]: Start difference. First operand 318 states and 420 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:39,113 INFO L93 Difference]: Finished difference Result 547 states and 729 transitions. [2024-10-14 11:01:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:01:39,114 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-10-14 11:01:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:39,117 INFO L225 Difference]: With dead ends: 547 [2024-10-14 11:01:39,117 INFO L226 Difference]: Without dead ends: 368 [2024-10-14 11:01:39,118 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-14 11:01:39,119 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:39,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 114 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:01:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-14 11:01:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 215. [2024-10-14 11:01:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 166 states have internal predecessors, (199), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:01:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 283 transitions. [2024-10-14 11:01:39,153 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 283 transitions. Word has length 97 [2024-10-14 11:01:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:39,153 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 283 transitions. [2024-10-14 11:01:39,153 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 283 transitions. [2024-10-14 11:01:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 11:01:39,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:39,155 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:39,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:01:39,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1666591110, now seen corresponding path program 1 times [2024-10-14 11:01:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413693887] [2024-10-14 11:01:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413693887] [2024-10-14 11:01:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413693887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:01:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529199840] [2024-10-14 11:01:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:01:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:01:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:01:39,227 INFO L87 Difference]: Start difference. First operand 215 states and 283 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:39,315 INFO L93 Difference]: Finished difference Result 354 states and 466 transitions. [2024-10-14 11:01:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:01:39,316 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-10-14 11:01:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:39,318 INFO L225 Difference]: With dead ends: 354 [2024-10-14 11:01:39,318 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 11:01:39,319 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-14 11:01:39,319 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 55 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:39,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:01:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 11:01:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 207. [2024-10-14 11:01:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 158 states have internal predecessors, (186), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:01:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 270 transitions. [2024-10-14 11:01:39,352 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 270 transitions. Word has length 98 [2024-10-14 11:01:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 270 transitions. [2024-10-14 11:01:39,352 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 270 transitions. [2024-10-14 11:01:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 11:01:39,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:39,354 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:01:39,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:39,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1457779746, now seen corresponding path program 1 times [2024-10-14 11:01:39,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205592397] [2024-10-14 11:01:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:01:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:01:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:01:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:01:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:01:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:01:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:01:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:01:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:01:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:01:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:01:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:01:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:01:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:01:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:01:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:01:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205592397] [2024-10-14 11:01:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205592397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:01:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485754990] [2024-10-14 11:01:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:39,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:01:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:01:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:01:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:01:39,934 INFO L87 Difference]: Start difference. First operand 207 states and 270 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:40,241 INFO L93 Difference]: Finished difference Result 365 states and 469 transitions. [2024-10-14 11:01:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:01:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-10-14 11:01:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:40,243 INFO L225 Difference]: With dead ends: 365 [2024-10-14 11:01:40,243 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 11:01:40,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:01:40,245 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 84 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:40,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 312 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:01:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 11:01:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2024-10-14 11:01:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 154 states have (on average 1.155844155844156) internal successors, (178), 154 states have internal predecessors, (178), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:01:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 262 transitions. [2024-10-14 11:01:40,270 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 262 transitions. Word has length 99 [2024-10-14 11:01:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:40,270 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 262 transitions. [2024-10-14 11:01:40,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:01:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 262 transitions. [2024-10-14 11:01:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 11:01:40,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:40,272 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:40,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:01:40,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:40,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1261039487, now seen corresponding path program 1 times [2024-10-14 11:01:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:01:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621276783] [2024-10-14 11:01:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:01:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:01:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861639034] [2024-10-14 11:01:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:40,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:01:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:01:40,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:01:40,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:01:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:01:40,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:01:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:01:40,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:01:40,512 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:01:40,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:01:40,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:01:40,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 11:01:40,719 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:01:40,791 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:01:40,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:01:40 BoogieIcfgContainer [2024-10-14 11:01:40,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:01:40,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:01:40,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:01:40,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:01:40,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:01:20" (3/4) ... [2024-10-14 11:01:40,797 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:01:40,798 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:01:40,799 INFO L158 Benchmark]: Toolchain (without parser) took 21646.68ms. Allocated memory was 163.6MB in the beginning and 482.3MB in the end (delta: 318.8MB). Free memory was 107.2MB in the beginning and 368.6MB in the end (delta: -261.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,799 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:01:40,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.96ms. Allocated memory is still 163.6MB. Free memory was 107.2MB in the beginning and 93.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.52ms. Allocated memory is still 163.6MB. Free memory was 93.9MB in the beginning and 90.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,800 INFO L158 Benchmark]: Boogie Preprocessor took 68.19ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,800 INFO L158 Benchmark]: RCFGBuilder took 542.89ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 87.1MB in the beginning and 198.5MB in the end (delta: -111.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,801 INFO L158 Benchmark]: TraceAbstraction took 20684.92ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 198.5MB in the beginning and 369.6MB in the end (delta: -171.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2024-10-14 11:01:40,801 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 482.3MB. Free memory was 369.6MB in the beginning and 368.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:01:40,802 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.19ms. Allocated memory is still 163.6MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.96ms. Allocated memory is still 163.6MB. Free memory was 107.2MB in the beginning and 93.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.52ms. Allocated memory is still 163.6MB. Free memory was 93.9MB in the beginning and 90.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.19ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 542.89ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 87.1MB in the beginning and 198.5MB in the end (delta: -111.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20684.92ms. Allocated memory was 230.7MB in the beginning and 482.3MB in the end (delta: 251.7MB). Free memory was 198.5MB in the beginning and 369.6MB in the end (delta: -171.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 482.3MB. Free memory was 369.6MB in the beginning and 368.6MB 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 to_int at line 91, overapproximation of bitwiseOr at line 91, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 99; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] signed long int var_1_9 = 5; [L26] signed long int var_1_10 = 0; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L87] last_1_var_1_11 = var_1_11 [L88] last_1_var_1_14 = var_1_14 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=5, var_1_9=5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=5] [L70] var_1_9 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L71] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L72] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L73] var_1_10 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L74] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L75] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L81] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L83] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=99, var_1_7=16383, var_1_8=256, var_1_9=0] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_7=16383, var_1_8=256, var_1_9=0] [L91] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L91-L92] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((signed long int) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=0, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=19, var_1_7=16383, var_1_8=256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1252 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1252 mSDsluCounter, 2383 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1555 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2750 IncrementalHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 828 mSDtfsCounter, 2750 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 487 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1253 NumberOfCodeBlocks, 1253 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7663 SizeOfPredicates, 4 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4251/4368 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-14 11:01:40,878 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 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/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-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:01:43,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:01:43,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:01:43,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:01:43,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:01:43,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:01:43,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:01:43,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:01:43,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:01:43,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:01:43,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:01:43,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:01:43,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:01:43,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:01:43,134 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:01:43,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:01:43,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:01:43,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:01:43,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:01:43,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:01:43,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:01:43,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:01:43,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:01:43,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:01:43,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:01:43,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:01:43,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:01:43,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:01:43,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:01:43,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:01:43,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:01:43,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:01:43,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:01:43,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:01:43,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:01:43,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:01:43,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:01:43,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:01:43,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:01:43,144 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:01:43,144 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 -> 6a09075700c0165e7f87ec4195e4b424ce35f231e25baba100aa11fb885230d3 [2024-10-14 11:01:43,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:01:43,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:01:43,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:01:43,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:01:43,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:01:43,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:44,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:01:45,153 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:01:45,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:45,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93fa2da4/024098cdb43f4ce6b89f9fea574be50e/FLAG87d72a7c2 [2024-10-14 11:01:45,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d93fa2da4/024098cdb43f4ce6b89f9fea574be50e [2024-10-14 11:01:45,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:01:45,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:01:45,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:01:45,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:01:45,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:01:45,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f73b078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45, skipping insertion in model container [2024-10-14 11:01:45,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:01:45,742 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-18.i[916,929] [2024-10-14 11:01:45,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:01:45,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:01:45,854 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-18.i[916,929] [2024-10-14 11:01:45,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:01:45,900 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:01:45,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45 WrapperNode [2024-10-14 11:01:45,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:01:45,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:01:45,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:01:45,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:01:45,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,954 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-14 11:01:45,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:01:45,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:01:45,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:01:45,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:01:45,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,990 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-14 11:01:45,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:45,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:01:46,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:01:46,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:01:46,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:01:46,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (1/1) ... [2024-10-14 11:01:46,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:01:46,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:01:46,061 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-14 11:01:46,064 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-14 11:01:46,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:01:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:01:46,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:01:46,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:01:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:01:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:01:46,179 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:01:46,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:01:46,510 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 11:01:46,510 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:01:46,601 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:01:46,601 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:01:46,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:01:46 BoogieIcfgContainer [2024-10-14 11:01:46,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:01:46,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:01:46,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:01:46,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:01:46,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:01:45" (1/3) ... [2024-10-14 11:01:46,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30defa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:01:46, skipping insertion in model container [2024-10-14 11:01:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:01:45" (2/3) ... [2024-10-14 11:01:46,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30defa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:01:46, skipping insertion in model container [2024-10-14 11:01:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:01:46" (3/3) ... [2024-10-14 11:01:46,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-18.i [2024-10-14 11:01:46,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:01:46,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:01:46,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:01:46,702 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;@4256cc5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:01:46,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:01:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:01:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 11:01:46,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:46,716 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:46,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:46,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -384923238, now seen corresponding path program 1 times [2024-10-14 11:01:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:01:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502521409] [2024-10-14 11:01:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:46,736 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-14 11:01:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:01:46,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-14 11:01:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 11:01:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:46,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:01:46,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:01:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 11:01:46,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:01:46,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:01:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502521409] [2024-10-14 11:01:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502521409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:01:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:01:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:01:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531305893] [2024-10-14 11:01:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:01:46,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:01:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:01:46,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:01:46,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:01:46,941 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:01:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:46,997 INFO L93 Difference]: Finished difference Result 79 states and 138 transitions. [2024-10-14 11:01:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:01:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2024-10-14 11:01:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:47,006 INFO L225 Difference]: With dead ends: 79 [2024-10-14 11:01:47,006 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 11:01:47,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-14 11:01:47,013 INFO L432 NwaCegarLoop]: 55 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, 55 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-14 11:01:47,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:01:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 11:01:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 11:01:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:01:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-10-14 11:01:47,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 86 [2024-10-14 11:01:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:47,054 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-10-14 11:01:47,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:01:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-10-14 11:01:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 11:01:47,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:47,058 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:47,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-14 11:01:47,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-14 11:01:47,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:47,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -246381862, now seen corresponding path program 1 times [2024-10-14 11:01:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:01:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292053609] [2024-10-14 11:01:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:47,262 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-14 11:01:47,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:01:47,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-14 11:01:47,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 11:01:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:47,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 11:01:47,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:01:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 11:01:48,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:01:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 11:01:48,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:01:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292053609] [2024-10-14 11:01:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292053609] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:01:48,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:01:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-14 11:01:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872747654] [2024-10-14 11:01:48,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:01:48,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:01:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:01:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:01:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:01:48,489 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-14 11:01:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:01:49,829 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2024-10-14 11:01:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 11:01:49,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 86 [2024-10-14 11:01:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:01:49,834 INFO L225 Difference]: With dead ends: 211 [2024-10-14 11:01:49,834 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 11:01:49,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-10-14 11:01:49,837 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 155 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:01:49,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 203 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 11:01:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 11:01:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 86. [2024-10-14 11:01:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 11:01:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-10-14 11:01:49,883 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 86 [2024-10-14 11:01:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:01:49,884 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-10-14 11:01:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-14 11:01:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-10-14 11:01:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 11:01:49,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:01:49,888 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:01:49,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-14 11:01:50,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-14 11:01:50,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:01:50,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:01:50,090 INFO L85 PathProgramCache]: Analyzing trace with hash 942796332, now seen corresponding path program 1 times [2024-10-14 11:01:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:01:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268706390] [2024-10-14 11:01:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:01:50,092 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-14 11:01:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:01:50,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-14 11:01:50,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:01:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:01:50,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 11:01:50,210 INFO L278 TraceCheckSpWp]: Computing forward predicates...