./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-39.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-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:03:25,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:03:25,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:03:25,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:03:25,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:03:25,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:03:25,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:03:25,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:03:25,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:03:25,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:03:25,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:03:25,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:03:25,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:03:25,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:03:25,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:03:25,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:03:25,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:03:25,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:03:25,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:03:25,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:03:25,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:03:25,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:03:25,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:03:25,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:03:25,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:03:25,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:03:25,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:03:25,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:03:25,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:03:25,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:03:25,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:03:25,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:03:25,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:03:25,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:03:25,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:03:25,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:03:25,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:03:25,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:03:25,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:03:25,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:03:25,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:03:25,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:03:25,765 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2024-10-14 11:03:26,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:03:26,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:03:26,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:03:26,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:03:26,046 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:03:26,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:03:27,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:03:27,742 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:03:27,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:03:27,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94a8bb3d/08885d7fc8c541c6b324fcda637cf319/FLAGd4ec1b96f [2024-10-14 11:03:28,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94a8bb3d/08885d7fc8c541c6b324fcda637cf319 [2024-10-14 11:03:28,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:03:28,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:03:28,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:03:28,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:03:28,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:03:28,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db5d826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28, skipping insertion in model container [2024-10-14 11:03:28,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:03:28,308 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-39.i[916,929] [2024-10-14 11:03:28,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:03:28,363 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:03:28,372 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-39.i[916,929] [2024-10-14 11:03:28,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:03:28,417 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:03:28,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28 WrapperNode [2024-10-14 11:03:28,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:03:28,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:03:28,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:03:28,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:03:28,430 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:03:28" (1/1) ... [2024-10-14 11:03:28,442 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:03:28" (1/1) ... [2024-10-14 11:03:28,483 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-14 11:03:28,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:03:28,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:03:28,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:03:28,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:03:28,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,517 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:03:28,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:03:28,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:03:28,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:03:28,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:03:28,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (1/1) ... [2024-10-14 11:03:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:03:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:03:28,583 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:03:28,589 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:03:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:03:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:03:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:03:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:03:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:03:28,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:03:28,713 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:03:28,715 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:03:28,979 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 11:03:28,980 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:03:29,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:03:29,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:03:29,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:03:29 BoogieIcfgContainer [2024-10-14 11:03:29,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:03:29,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:03:29,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:03:29,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:03:29,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:03:28" (1/3) ... [2024-10-14 11:03:29,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510f3943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:03:29, skipping insertion in model container [2024-10-14 11:03:29,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:03:28" (2/3) ... [2024-10-14 11:03:29,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510f3943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:03:29, skipping insertion in model container [2024-10-14 11:03:29,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:03:29" (3/3) ... [2024-10-14 11:03:29,031 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:03:29,052 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:03:29,053 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:03:29,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:03:29,133 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;@4e8d07ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:03:29,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:03:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 11:03:29,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:29,149 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:29,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:29,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1623662536, now seen corresponding path program 1 times [2024-10-14 11:03:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764227215] [2024-10-14 11:03:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:29,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764227215] [2024-10-14 11:03:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764227215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:03:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137581406] [2024-10-14 11:03:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:29,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:03:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:03:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:03:29,552 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 11:03:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:29,590 INFO L93 Difference]: Finished difference Result 103 states and 179 transitions. [2024-10-14 11:03:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:03:29,594 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-10-14 11:03:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:29,601 INFO L225 Difference]: With dead ends: 103 [2024-10-14 11:03:29,601 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 11:03:29,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:03:29,609 INFO L432 NwaCegarLoop]: 73 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, 73 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:03:29,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:03:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 11:03:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 11:03:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2024-10-14 11:03:29,658 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 115 [2024-10-14 11:03:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:29,659 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2024-10-14 11:03:29,659 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 11:03:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-10-14 11:03:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 11:03:29,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:29,663 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:03:29,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash 894103238, now seen corresponding path program 1 times [2024-10-14 11:03:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017290283] [2024-10-14 11:03:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017290283] [2024-10-14 11:03:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017290283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:03:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595848581] [2024-10-14 11:03:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:31,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:03:31,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:31,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:03:31,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:03:31,002 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:31,308 INFO L93 Difference]: Finished difference Result 118 states and 173 transitions. [2024-10-14 11:03:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:03:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-14 11:03:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:31,311 INFO L225 Difference]: With dead ends: 118 [2024-10-14 11:03:31,311 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 11:03:31,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:03:31,313 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:31,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 199 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:03:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 11:03:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2024-10-14 11:03:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-14 11:03:31,331 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 115 [2024-10-14 11:03:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:31,334 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-14 11:03:31,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-14 11:03:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 11:03:31,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:31,338 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:03:31,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1238627288, now seen corresponding path program 1 times [2024-10-14 11:03:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33375792] [2024-10-14 11:03:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33375792] [2024-10-14 11:03:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33375792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:03:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308731943] [2024-10-14 11:03:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:03:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:03:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:03:32,502 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:32,893 INFO L93 Difference]: Finished difference Result 141 states and 203 transitions. [2024-10-14 11:03:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:03:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 11:03:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:32,897 INFO L225 Difference]: With dead ends: 141 [2024-10-14 11:03:32,897 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 11:03:32,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:03:32,899 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 68 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:32,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 205 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:03:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 11:03:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2024-10-14 11:03:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-14 11:03:32,909 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 116 [2024-10-14 11:03:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-14 11:03:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-14 11:03:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 11:03:32,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:32,913 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:32,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:03:32,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1918685658, now seen corresponding path program 1 times [2024-10-14 11:03:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043240769] [2024-10-14 11:03:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043240769] [2024-10-14 11:03:34,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043240769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:34,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:34,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:03:34,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310778248] [2024-10-14 11:03:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:03:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:03:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:03:34,195 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:34,785 INFO L93 Difference]: Finished difference Result 132 states and 192 transitions. [2024-10-14 11:03:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:03:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-14 11:03:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:34,789 INFO L225 Difference]: With dead ends: 132 [2024-10-14 11:03:34,789 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 11:03:34,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:03:34,790 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:34,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 225 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:03:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 11:03:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2024-10-14 11:03:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-14 11:03:34,804 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 116 [2024-10-14 11:03:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-14 11:03:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-14 11:03:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 11:03:34,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:34,807 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:34,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:03:34,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:34,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -120624181, now seen corresponding path program 1 times [2024-10-14 11:03:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897961612] [2024-10-14 11:03:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897961612] [2024-10-14 11:03:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897961612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:03:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933770435] [2024-10-14 11:03:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:43,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:03:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:03:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:03:43,180 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:46,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 11:03:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:46,546 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2024-10-14 11:03:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:03:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 117 [2024-10-14 11:03:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:46,549 INFO L225 Difference]: With dead ends: 69 [2024-10-14 11:03:46,549 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 11:03:46,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:03:46,550 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:46,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 11:03:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 11:03:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-14 11:03:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-10-14 11:03:46,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 117 [2024-10-14 11:03:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:46,561 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-10-14 11:03:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-10-14 11:03:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:03:46,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:46,564 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:03:46,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash 60394081, now seen corresponding path program 1 times [2024-10-14 11:03:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:46,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241789397] [2024-10-14 11:03:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241789397] [2024-10-14 11:03:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241789397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:03:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678758660] [2024-10-14 11:03:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:03:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:03:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:03:53,744 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:54,305 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-10-14 11:03:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:03:54,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-14 11:03:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:54,308 INFO L225 Difference]: With dead ends: 76 [2024-10-14 11:03:54,308 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 11:03:54,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:03:54,309 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:54,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 436 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:03:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 11:03:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2024-10-14 11:03:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-10-14 11:03:54,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 118 [2024-10-14 11:03:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-10-14 11:03:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-10-14 11:03:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:03:54,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:54,318 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:03:54,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -748952545, now seen corresponding path program 1 times [2024-10-14 11:03:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164397171] [2024-10-14 11:03:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:54,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164397171] [2024-10-14 11:03:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164397171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:03:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232320955] [2024-10-14 11:03:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:54,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:03:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:03:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:03:54,805 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:55,082 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2024-10-14 11:03:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:03:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-14 11:03:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:55,084 INFO L225 Difference]: With dead ends: 76 [2024-10-14 11:03:55,084 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 11:03:55,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:03:55,085 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:55,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 436 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:03:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 11:03:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2024-10-14 11:03:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-10-14 11:03:55,094 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 118 [2024-10-14 11:03:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:55,094 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-10-14 11:03:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-10-14 11:03:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:03:55,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:55,098 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:03:55,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:55,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 608858083, now seen corresponding path program 1 times [2024-10-14 11:03:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913825495] [2024-10-14 11:03:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913825495] [2024-10-14 11:03:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913825495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:03:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536732167] [2024-10-14 11:03:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:55,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:03:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:03:55,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:03:55,201 INFO L87 Difference]: Start difference. First operand 60 states and 87 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:55,242 INFO L93 Difference]: Finished difference Result 126 states and 180 transitions. [2024-10-14 11:03:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:03:55,244 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-14 11:03:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:55,245 INFO L225 Difference]: With dead ends: 126 [2024-10-14 11:03:55,245 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 11:03:55,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:03:55,246 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:55,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:03:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 11:03:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-10-14 11:03:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-10-14 11:03:55,258 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 118 [2024-10-14 11:03:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:55,258 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-10-14 11:03:55,259 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-10-14 11:03:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 11:03:55,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:55,262 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:55,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:03:55,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:55,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1888968451, now seen corresponding path program 1 times [2024-10-14 11:03:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807386002] [2024-10-14 11:03:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:03:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:03:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:03:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:03:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:03:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:03:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:03:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:03:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:03:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:03:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:03:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:03:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:03:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:03:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:03:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:03:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:03:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:03:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 11:03:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:03:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 11:03:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:03:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807386002] [2024-10-14 11:03:55,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807386002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:03:55,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:03:55,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:03:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539554087] [2024-10-14 11:03:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:03:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:03:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:03:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:03:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:03:55,340 INFO L87 Difference]: Start difference. First operand 60 states and 86 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:03:55,388 INFO L93 Difference]: Finished difference Result 121 states and 173 transitions. [2024-10-14 11:03:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:03:55,389 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-14 11:03:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:03:55,390 INFO L225 Difference]: With dead ends: 121 [2024-10-14 11:03:55,390 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 11:03:55,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:03:55,391 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:03:55,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:03:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 11:03:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-10-14 11:03:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:03:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2024-10-14 11:03:55,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 118 [2024-10-14 11:03:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:03:55,397 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2024-10-14 11:03:55,397 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 11:03:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2024-10-14 11:03:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 11:03:55,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:03:55,398 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:55,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:03:55,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:03:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:03:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1624760561, now seen corresponding path program 1 times [2024-10-14 11:03:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:03:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277683650] [2024-10-14 11:03:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:03:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:03:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73865150] [2024-10-14 11:03:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:03:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:03:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:03:55,436 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:03:55,437 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:03:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:03:55,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:03:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:03:55,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:03:55,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:03:55,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:03:55,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:03:55,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 11:03:55,834 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:03:55,916 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:03:55,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:03:55 BoogieIcfgContainer [2024-10-14 11:03:55,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:03:55,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:03:55,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:03:55,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:03:55,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:03:29" (3/4) ... [2024-10-14 11:03:55,921 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:03:55,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:03:55,923 INFO L158 Benchmark]: Toolchain (without parser) took 27791.08ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 95.9MB in the beginning and 753.6MB in the end (delta: -657.7MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,923 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:03:55,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.67ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 82.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.49ms. Allocated memory is still 151.0MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,924 INFO L158 Benchmark]: Boogie Preprocessor took 58.96ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 77.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,924 INFO L158 Benchmark]: RCFGBuilder took 475.83ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 59.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,924 INFO L158 Benchmark]: TraceAbstraction took 26896.34ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 58.2MB in the beginning and 754.7MB in the end (delta: -696.5MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2024-10-14 11:03:55,924 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 960.5MB. Free memory was 754.7MB in the beginning and 753.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:03:55,926 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.18ms. Allocated memory is still 151.0MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.67ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 82.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.49ms. Allocated memory is still 151.0MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.96ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 77.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.83ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 59.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26896.34ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 58.2MB in the beginning and 754.7MB in the end (delta: -696.5MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 960.5MB. Free memory was 754.7MB in the beginning and 753.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 shiftLeft at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] signed long int var_1_7 = 1; [L29] signed long int var_1_8 = 7; [L30] signed long int var_1_9 = 1; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L73] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET updateVariables() [L101] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(var_1_2 >= var_1_1) [L45] var_1_6 = var_1_4 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741782, stepLocal_1=29, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741782, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92-L93] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 2198 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1603 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1104 IncrementalHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 595 mSDtfsCounter, 1104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 105 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1042 ConstructedInterpolants, 0 QuantifiedInterpolants, 10626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6156/6156 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:03:56,002 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-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:03:58,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:03:58,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:03:58,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:03:58,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:03:58,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:03:58,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:03:58,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:03:58,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:03:58,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:03:58,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:03:58,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:03:58,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:03:58,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:03:58,301 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:03:58,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:03:58,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:03:58,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:03:58,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:03:58,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:03:58,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:03:58,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:03:58,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:03:58,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:03:58,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:03:58,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:03:58,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:03:58,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:03:58,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:03:58,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:03:58,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:03:58,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:03:58,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:03:58,310 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:03:58,310 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:03:58,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:03:58,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:03:58,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:03:58,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:03:58,313 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:03:58,313 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2024-10-14 11:03:58,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:03:58,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:03:58,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:03:58,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:03:58,678 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:03:58,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:04:00,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:04:00,453 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:04:00,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:04:00,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d46aab06/31d524badfb746e3a5e28c2867dd9095/FLAG614b62e43 [2024-10-14 11:04:00,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d46aab06/31d524badfb746e3a5e28c2867dd9095 [2024-10-14 11:04:00,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:04:00,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:04:00,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:00,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:04:00,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:04:00,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b156bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00, skipping insertion in model container [2024-10-14 11:04:00,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:04:00,715 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i[916,929] [2024-10-14 11:04:00,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:00,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:04:00,823 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-39.i[916,929] [2024-10-14 11:04:00,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:00,881 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:04:00,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00 WrapperNode [2024-10-14 11:04:00,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:00,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:00,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:04:00,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:04:00,891 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:04:00" (1/1) ... [2024-10-14 11:04:00,915 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:04:00" (1/1) ... [2024-10-14 11:04:00,952 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-14 11:04:00,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:00,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:04:00,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:04:00,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:04:00,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,991 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:04:00,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:01,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:01,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:01,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:01,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:04:00" (1/1) ... [2024-10-14 11:04:01,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:04:01,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:04:01,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:04:01,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:04:01,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:04:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:04:01,058 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:04:01,061 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:04:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:04:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:04:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:04:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:04:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:04:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:04:01,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:04:01,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:04:01,558 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 11:04:01,559 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:04:01,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:04:01,633 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:04:01,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:01 BoogieIcfgContainer [2024-10-14 11:04:01,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:04:01,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:04:01,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:04:01,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:04:01,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:04:00" (1/3) ... [2024-10-14 11:04:01,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c68127e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:01, skipping insertion in model container [2024-10-14 11:04:01,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (2/3) ... [2024-10-14 11:04:01,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c68127e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:01, skipping insertion in model container [2024-10-14 11:04:01,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:01" (3/3) ... [2024-10-14 11:04:01,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2024-10-14 11:04:01,664 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:04:01,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:04:01,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:04:01,771 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;@450b6dce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:04:01,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:04:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 11:04:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 11:04:01,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:01,790 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:01,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:01,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1148432440, now seen corresponding path program 1 times [2024-10-14 11:04:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:04:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130994337] [2024-10-14 11:04:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:01,813 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:04:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:04:01,817 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:04:01,819 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:04:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:02,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 11:04:02,032 INFO L278 TraceCheckSpWp]: Computing forward predicates...