./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.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 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:38:49,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:38:49,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:38:49,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:38:49,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:38:49,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:38:49,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:38:49,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:38:49,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:38:49,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:38:49,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:38:49,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:38:49,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:38:49,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:38:49,673 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:38:49,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:38:49,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:38:49,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:38:49,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:38:49,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:38:49,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:38:49,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:38:49,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:38:49,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:38:49,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:38:49,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:38:49,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:38:49,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:38:49,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:38:49,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:38:49,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:38:49,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:38:49,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:38:49,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:38:49,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:38:49,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:38:49,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:38:49,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:38:49,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:38:49,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:38:49,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:38:49,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:38:49,688 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 -> 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 [2024-11-10 06:38:49,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:38:49,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:38:49,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:38:49,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:38:49,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:38:49,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:38:51,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:38:51,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:38:51,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:38:51,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e628d0f/69941c7474f74b828e75424c6238b742/FLAGbc3381674 [2024-11-10 06:38:51,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e628d0f/69941c7474f74b828e75424c6238b742 [2024-11-10 06:38:51,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:38:51,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:38:51,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:38:51,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:38:51,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:38:51,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:38:51" (1/1) ... [2024-11-10 06:38:51,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f65792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:51, skipping insertion in model container [2024-11-10 06:38:51,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:38:51" (1/1) ... [2024-11-10 06:38:51,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:38:52,030 WARN L250 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_has-floats_file-13.i[917,930] [2024-11-10 06:38:52,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:38:52,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:38:52,095 WARN L250 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_has-floats_file-13.i[917,930] [2024-11-10 06:38:52,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:38:52,145 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:38:52,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52 WrapperNode [2024-11-10 06:38:52,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:38:52,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:38:52,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:38:52,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:38:52,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,203 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-10 06:38:52,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:38:52,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:38:52,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:38:52,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:38:52,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,232 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-11-10 06:38:52,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:38:52,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:38:52,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:38:52,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:38:52,263 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (1/1) ... [2024-11-10 06:38:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:38:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:38:52,300 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-11-10 06:38:52,304 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-11-10 06:38:52,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:38:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:38:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:38:52,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:38:52,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:38:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:38:52,486 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:38:52,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:38:52,732 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 06:38:52,732 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:38:52,746 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:38:52,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:38:52,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:38:52 BoogieIcfgContainer [2024-11-10 06:38:52,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:38:52,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:38:52,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:38:52,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:38:52,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:38:51" (1/3) ... [2024-11-10 06:38:52,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5058a8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:38:52, skipping insertion in model container [2024-11-10 06:38:52,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:38:52" (2/3) ... [2024-11-10 06:38:52,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5058a8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:38:52, skipping insertion in model container [2024-11-10 06:38:52,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:38:52" (3/3) ... [2024-11-10 06:38:52,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:38:52,776 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:38:52,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:38:52,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:38:52,853 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;@45e81e02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:38:52,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:38:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 06:38:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 06:38:52,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:52,873 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:38:52,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1642934815, now seen corresponding path program 1 times [2024-11-10 06:38:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509836268] [2024-11-10 06:38:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:38:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:38:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:38:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:38:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:38:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:38:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:38:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509836268] [2024-11-10 06:38:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509836268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:38:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759564599] [2024-11-10 06:38:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:38:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:38:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:38:53,327 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 06:38:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:53,364 INFO L93 Difference]: Finished difference Result 96 states and 156 transitions. [2024-11-10 06:38:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:38:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-10 06:38:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:53,375 INFO L225 Difference]: With dead ends: 96 [2024-11-10 06:38:53,375 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 06:38:53,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-11-10 06:38:53,384 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:53,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:38:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 06:38:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 06:38:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 06:38:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-10 06:38:53,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 100 [2024-11-10 06:38:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-10 06:38:53,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 06:38:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-10 06:38:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:38:53,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:53,448 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:38:53,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:38:53,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1040048073, now seen corresponding path program 1 times [2024-11-10 06:38:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727369374] [2024-11-10 06:38:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:38:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:38:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:38:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:38:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:38:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:38:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:38:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727369374] [2024-11-10 06:38:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727369374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:55,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:38:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468651664] [2024-11-10 06:38:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:55,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:38:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:55,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:38:55,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:38:55,409 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:55,912 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2024-11-10 06:38:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:38:55,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:38:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:55,916 INFO L225 Difference]: With dead ends: 128 [2024-11-10 06:38:55,916 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 06:38:55,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:38:55,918 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 143 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:55,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 436 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:38:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 06:38:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2024-11-10 06:38:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:38:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-10 06:38:55,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 101 [2024-11-10 06:38:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:55,947 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-10 06:38:55,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-10 06:38:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:38:55,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:55,950 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:38:55,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:38:55,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1068677224, now seen corresponding path program 1 times [2024-11-10 06:38:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448399811] [2024-11-10 06:38:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:38:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:38:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:38:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:38:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:38:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:38:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:38:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448399811] [2024-11-10 06:38:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448399811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:38:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622662958] [2024-11-10 06:38:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:38:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:38:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:38:57,120 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:57,673 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2024-11-10 06:38:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:38:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:38:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:57,678 INFO L225 Difference]: With dead ends: 125 [2024-11-10 06:38:57,678 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 06:38:57,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:38:57,680 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:57,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 581 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:38:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 06:38:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2024-11-10 06:38:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:38:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-10 06:38:57,708 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 101 [2024-11-10 06:38:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:57,709 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-10 06:38:57,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-10 06:38:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:38:57,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:57,711 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:38:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:38:57,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:57,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -767406390, now seen corresponding path program 1 times [2024-11-10 06:38:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:57,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832801507] [2024-11-10 06:38:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:38:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:38:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:38:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:38:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:38:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:38:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:38:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832801507] [2024-11-10 06:38:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832801507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:38:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696310588] [2024-11-10 06:38:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:58,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:38:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:38:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:38:58,595 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:38:58,872 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2024-11-10 06:38:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:38:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:38:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:38:58,874 INFO L225 Difference]: With dead ends: 125 [2024-11-10 06:38:58,875 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 06:38:58,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:38:58,876 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 108 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:38:58,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 450 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:38:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 06:38:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2024-11-10 06:38:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:38:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2024-11-10 06:38:58,907 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 101 [2024-11-10 06:38:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:38:58,908 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2024-11-10 06:38:58,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:38:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-11-10 06:38:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:38:58,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:38:58,913 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:38:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:38:58,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:38:58,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:38:58,915 INFO L85 PathProgramCache]: Analyzing trace with hash -738777239, now seen corresponding path program 1 times [2024-11-10 06:38:58,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:38:58,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075519255] [2024-11-10 06:38:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:38:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:38:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:38:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:38:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:38:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:38:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:38:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:38:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:38:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:38:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:38:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:38:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:38:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:38:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:38:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:38:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:38:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:38:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:38:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:38:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075519255] [2024-11-10 06:38:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075519255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:38:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:38:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:38:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320828860] [2024-11-10 06:38:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:38:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:38:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:38:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:38:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:38:59,814 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:00,130 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2024-11-10 06:39:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:39:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:39:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:00,132 INFO L225 Difference]: With dead ends: 122 [2024-11-10 06:39:00,134 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 06:39:00,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:39:00,136 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 85 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:00,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 553 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:39:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 06:39:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2024-11-10 06:39:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:39:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-10 06:39:00,157 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 101 [2024-11-10 06:39:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:00,158 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-10 06:39:00,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-10 06:39:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:00,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:00,160 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:00,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:39:00,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:00,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash 843534568, now seen corresponding path program 1 times [2024-11-10 06:39:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:39:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764269675] [2024-11-10 06:39:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:39:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:39:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:39:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:39:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:39:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:39:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:39:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:39:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:39:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:39:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:39:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:39:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:39:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:39:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:39:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:39:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:39:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:39:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764269675] [2024-11-10 06:39:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764269675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:39:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:39:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:39:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230321646] [2024-11-10 06:39:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:39:01,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:39:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:39:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:39:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:39:01,061 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:01,667 INFO L93 Difference]: Finished difference Result 193 states and 268 transitions. [2024-11-10 06:39:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:39:01,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:39:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:01,670 INFO L225 Difference]: With dead ends: 193 [2024-11-10 06:39:01,670 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 06:39:01,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-10 06:39:01,671 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 159 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:01,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 490 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:39:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 06:39:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2024-11-10 06:39:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.191304347826087) internal successors, (137), 115 states have internal predecessors, (137), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 06:39:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 257 transitions. [2024-11-10 06:39:01,697 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 257 transitions. Word has length 101 [2024-11-10 06:39:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:01,698 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 257 transitions. [2024-11-10 06:39:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 257 transitions. [2024-11-10 06:39:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:01,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:01,700 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:39:01,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 872163719, now seen corresponding path program 1 times [2024-11-10 06:39:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:39:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100915169] [2024-11-10 06:39:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:39:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:39:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:39:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:39:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:39:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:39:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:39:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:39:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:39:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:39:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:39:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:39:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:39:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:39:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:39:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:39:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:39:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:39:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100915169] [2024-11-10 06:39:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100915169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:39:02,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:39:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:39:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956671407] [2024-11-10 06:39:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:39:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:39:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:39:02,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:39:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:39:02,380 INFO L87 Difference]: Start difference. First operand 180 states and 257 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:02,918 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-11-10 06:39:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:39:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:39:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:02,921 INFO L225 Difference]: With dead ends: 206 [2024-11-10 06:39:02,922 INFO L226 Difference]: Without dead ends: 203 [2024-11-10 06:39:02,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-10 06:39:02,923 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:02,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 646 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:39:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-10 06:39:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-11-10 06:39:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 118 states have (on average 1.194915254237288) internal successors, (141), 118 states have internal predecessors, (141), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 06:39:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 261 transitions. [2024-11-10 06:39:02,944 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 261 transitions. Word has length 101 [2024-11-10 06:39:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:02,945 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 261 transitions. [2024-11-10 06:39:02,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 261 transitions. [2024-11-10 06:39:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:02,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:02,946 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:02,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:39:02,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:02,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -935290744, now seen corresponding path program 1 times [2024-11-10 06:39:02,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:39:02,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242986478] [2024-11-10 06:39:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:02,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:39:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:39:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:39:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:39:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:39:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:39:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:39:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:39:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:39:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:39:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:39:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:39:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:39:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:39:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 06:39:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:39:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:39:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:39:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242986478] [2024-11-10 06:39:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242986478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:39:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:39:03,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:39:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344833621] [2024-11-10 06:39:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:39:03,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:39:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:39:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:39:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:39:03,649 INFO L87 Difference]: Start difference. First operand 183 states and 261 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:04,077 INFO L93 Difference]: Finished difference Result 224 states and 302 transitions. [2024-11-10 06:39:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:39:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:39:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:04,080 INFO L225 Difference]: With dead ends: 224 [2024-11-10 06:39:04,080 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 06:39:04,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:39:04,082 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 91 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:04,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:39:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 06:39:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 180. [2024-11-10 06:39:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.191304347826087) internal successors, (137), 115 states have internal predecessors, (137), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 06:39:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 257 transitions. [2024-11-10 06:39:04,104 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 257 transitions. Word has length 101 [2024-11-10 06:39:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 257 transitions. [2024-11-10 06:39:04,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 257 transitions. [2024-11-10 06:39:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:04,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:04,106 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:04,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:39:04,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:04,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -756903286, now seen corresponding path program 1 times [2024-11-10 06:39:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:39:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935889046] [2024-11-10 06:39:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:39:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:39:04,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193801405] [2024-11-10 06:39:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:39:04,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:39:04,137 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-11-10 06:39:04,138 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-11-10 06:39:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:39:04,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:39:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:39:04,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:39:04,362 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:39:04,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:39:04,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:39:04,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:39:04,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:39:04,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:39:04,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:39:04 BoogieIcfgContainer [2024-11-10 06:39:04,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:39:04,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:39:04,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:39:04,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:39:04,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:38:52" (3/4) ... [2024-11-10 06:39:04,667 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:39:04,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:39:04,669 INFO L158 Benchmark]: Toolchain (without parser) took 12841.40ms. Allocated memory was 148.9MB in the beginning and 327.2MB in the end (delta: 178.3MB). Free memory was 93.0MB in the beginning and 248.2MB in the end (delta: -155.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,669 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:39:04,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.16ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 78.6MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.94ms. Allocated memory is still 148.9MB. Free memory was 78.3MB in the beginning and 75.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,670 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 148.9MB. Free memory was 75.9MB in the beginning and 72.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,671 INFO L158 Benchmark]: IcfgBuilder took 485.28ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 72.7MB in the beginning and 148.6MB in the end (delta: -75.9MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,671 INFO L158 Benchmark]: TraceAbstraction took 11914.03ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 147.6MB in the beginning and 248.2MB in the end (delta: -100.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 06:39:04,673 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 327.2MB. Free memory is still 248.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:39:04,675 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.17ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.16ms. Allocated memory is still 148.9MB. Free memory was 92.7MB in the beginning and 78.6MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.94ms. Allocated memory is still 148.9MB. Free memory was 78.3MB in the beginning and 75.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 148.9MB. Free memory was 75.9MB in the beginning and 72.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 485.28ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 72.7MB in the beginning and 148.6MB in the end (delta: -75.9MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11914.03ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 147.6MB in the beginning and 248.2MB in the end (delta: -100.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 327.2MB. Free memory is still 248.2MB. 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 someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] double var_1_12 = 128.4; [L32] double var_1_13 = 50.2; [L33] double var_1_14 = 3.8; [L34] double var_1_15 = 25.1; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L77] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L78] var_1_13 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L80] var_1_14 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L81] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L82] var_1_15 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L83] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L96] RET updateVariables() [L97] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L19] reach_error() VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 3800 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2922 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 878 mSDtfsCounter, 1387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=7, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 176 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1009 NumberOfCodeBlocks, 1009 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 799 ConstructedInterpolants, 0 QuantifiedInterpolants, 2636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3360/3360 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-11-10 06:39:04,729 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.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 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:39:07,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:39:07,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:39:07,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:39:07,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:39:07,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:39:07,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:39:07,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:39:07,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:39:07,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:39:07,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:39:07,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:39:07,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:39:07,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:39:07,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:39:07,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:39:07,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:39:07,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:39:07,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:39:07,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:39:07,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:39:07,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:39:07,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:39:07,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:39:07,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:39:07,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:39:07,228 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:39:07,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:39:07,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:39:07,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:39:07,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:39:07,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:39:07,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:39:07,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:39:07,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:39:07,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:39:07,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:39:07,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:39:07,244 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:39:07,244 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:39:07,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:39:07,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:39:07,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:39:07,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:39:07,246 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 -> 3653ee9b8dc6b7aee8e6b7da10ac828d65da62269c83c8e52fa2ba1e8499c5f1 [2024-11-10 06:39:07,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:39:07,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:39:07,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:39:07,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:39:07,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:39:07,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:39:09,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:39:09,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:39:09,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:39:09,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b2c7821/c0a2df9b80b14c6b8cad8e2ebd45a800/FLAG65f391623 [2024-11-10 06:39:09,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b2c7821/c0a2df9b80b14c6b8cad8e2ebd45a800 [2024-11-10 06:39:09,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:39:09,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:39:09,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:39:09,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:39:09,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:39:09,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:39:09" (1/1) ... [2024-11-10 06:39:09,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5090b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:09, skipping insertion in model container [2024-11-10 06:39:09,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:39:09" (1/1) ... [2024-11-10 06:39:09,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:39:09,902 WARN L250 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_has-floats_file-13.i[917,930] [2024-11-10 06:39:09,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:39:09,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:39:10,026 WARN L250 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_has-floats_file-13.i[917,930] [2024-11-10 06:39:10,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:39:10,089 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:39:10,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10 WrapperNode [2024-11-10 06:39:10,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:39:10,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:39:10,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:39:10,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:39:10,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,152 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-10 06:39:10,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:39:10,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:39:10,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:39:10,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:39:10,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,190 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-11-10 06:39:10,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:39:10,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:39:10,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:39:10,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:39:10,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (1/1) ... [2024-11-10 06:39:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:39:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:39:10,265 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-11-10 06:39:10,269 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-11-10 06:39:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:39:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:39:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:39:10,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:39:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:39:10,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:39:10,419 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:39:10,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:39:16,302 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 06:39:16,303 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:39:16,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:39:16,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:39:16,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:39:16 BoogieIcfgContainer [2024-11-10 06:39:16,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:39:16,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:39:16,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:39:16,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:39:16,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:39:09" (1/3) ... [2024-11-10 06:39:16,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a8baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:39:16, skipping insertion in model container [2024-11-10 06:39:16,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:39:10" (2/3) ... [2024-11-10 06:39:16,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a8baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:39:16, skipping insertion in model container [2024-11-10 06:39:16,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:39:16" (3/3) ... [2024-11-10 06:39:16,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-13.i [2024-11-10 06:39:16,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:39:16,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:39:16,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:39:16,406 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;@4fa4468c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:39:16,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:39:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 06:39:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 06:39:16,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:16,418 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:16,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1642934815, now seen corresponding path program 1 times [2024-11-10 06:39:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:39:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395835795] [2024-11-10 06:39:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:16,434 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-11-10 06:39:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:39:16,438 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-11-10 06:39:16,439 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-11-10 06:39:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:16,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:39:16,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:39:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-10 06:39:16,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:39:16,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:39:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395835795] [2024-11-10 06:39:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395835795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:39:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:39:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:39:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176335135] [2024-11-10 06:39:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:39:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:39:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:39:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:39:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:39:16,894 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 06:39:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:16,928 INFO L93 Difference]: Finished difference Result 96 states and 156 transitions. [2024-11-10 06:39:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:39:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-10 06:39:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:16,938 INFO L225 Difference]: With dead ends: 96 [2024-11-10 06:39:16,939 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 06:39:16,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-11-10 06:39:16,947 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:16,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:39:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 06:39:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 06:39:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 06:39:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-10 06:39:16,997 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 100 [2024-11-10 06:39:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-10 06:39:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 06:39:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-10 06:39:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:17,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:17,006 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:17,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:39:17,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:39:17,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1040048073, now seen corresponding path program 1 times [2024-11-10 06:39:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:39:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950897926] [2024-11-10 06:39:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:17,214 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-11-10 06:39:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:39:17,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:39:17,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:39:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:17,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 06:39:17,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:39:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 06:39:17,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:39:17,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:39:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950897926] [2024-11-10 06:39:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950897926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:39:17,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:39:17,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:39:17,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576943058] [2024-11-10 06:39:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:39:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:39:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:39:17,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:39:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:39:17,800 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:19,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:39:23,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:39:26,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:39:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:39:26,481 INFO L93 Difference]: Finished difference Result 179 states and 251 transitions. [2024-11-10 06:39:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:39:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-10 06:39:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:39:26,518 INFO L225 Difference]: With dead ends: 179 [2024-11-10 06:39:26,518 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 06:39:26,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:39:26,520 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:39:26,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 237 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-10 06:39:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 06:39:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2024-11-10 06:39:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-10 06:39:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 184 transitions. [2024-11-10 06:39:26,564 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 184 transitions. Word has length 101 [2024-11-10 06:39:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:39:26,565 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 184 transitions. [2024-11-10 06:39:26,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 06:39:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 184 transitions. [2024-11-10 06:39:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 06:39:26,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:39:26,567 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:39:26,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 06:39:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:39:26,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:39:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:39:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash -767406390, now seen corresponding path program 1 times [2024-11-10 06:39:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:39:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795823892] [2024-11-10 06:39:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:39:26,772 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-11-10 06:39:26,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:39:26,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:39:26,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:39:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:39:27,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 06:39:27,133 INFO L278 TraceCheckSpWp]: Computing forward predicates...