./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-37.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 26fb43b660eb5bfaf25248556887d19789383a6fa9c06b78f25f9a13c404f1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:37:50,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:37:50,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:37:50,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:37:50,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:37:50,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:37:50,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:37:50,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:37:50,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:37:50,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:37:50,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:37:50,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:37:50,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:37:50,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:37:50,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:37:50,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:37:50,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:37:50,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:37:50,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:37:50,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:37:50,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:37:50,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:37:50,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:37:50,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:37:50,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:37:50,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:37:50,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:37:50,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:37:50,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:37:50,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:37:50,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:37:50,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:37:50,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:37:50,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:37:50,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:37:50,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:37:50,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:37:50,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:37:50,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:37:50,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:37:50,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:37:50,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:37:50,325 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 -> 26fb43b660eb5bfaf25248556887d19789383a6fa9c06b78f25f9a13c404f1a7 [2024-11-12 04:37:50,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:37:50,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:37:50,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:37:50,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:37:50,657 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:37:50,658 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-37.i [2024-11-12 04:37:52,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:37:52,341 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:37:52,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-37.i [2024-11-12 04:37:52,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52570497c/313745e27e5e4dd9a1bb4db24d35d9d8/FLAGb39cbab70 [2024-11-12 04:37:52,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52570497c/313745e27e5e4dd9a1bb4db24d35d9d8 [2024-11-12 04:37:52,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:37:52,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:37:52,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:37:52,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:37:52,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:37:52,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2181f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52, skipping insertion in model container [2024-11-12 04:37:52,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:37:52,573 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-37.i[917,930] [2024-11-12 04:37:52,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:37:52,627 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:37:52,639 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-37.i[917,930] [2024-11-12 04:37:52,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:37:52,678 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:37:52,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52 WrapperNode [2024-11-12 04:37:52,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:37:52,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:37:52,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:37:52,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:37:52,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,737 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-12 04:37:52,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:37:52,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:37:52,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:37:52,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:37:52,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,780 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-12 04:37:52,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:37:52,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:37:52,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:37:52,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:37:52,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (1/1) ... [2024-11-12 04:37:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:37:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:37:52,848 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-12 04:37:52,856 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-12 04:37:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:37:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:37:52,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:37:52,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:37:52,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:37:52,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:37:53,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:37:53,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:37:53,365 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 04:37:53,365 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:37:53,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:37:53,380 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:37:53,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:37:53 BoogieIcfgContainer [2024-11-12 04:37:53,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:37:53,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:37:53,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:37:53,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:37:53,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:37:52" (1/3) ... [2024-11-12 04:37:53,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d80ad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:37:53, skipping insertion in model container [2024-11-12 04:37:53,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:37:52" (2/3) ... [2024-11-12 04:37:53,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d80ad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:37:53, skipping insertion in model container [2024-11-12 04:37:53,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:37:53" (3/3) ... [2024-11-12 04:37:53,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-37.i [2024-11-12 04:37:53,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:37:53,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:37:53,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:37:53,485 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;@51a93c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:37:53,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:37:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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-12 04:37:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 04:37:53,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:37:53,506 INFO L218 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-12 04:37:53,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:37:53,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:37:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash -616977591, now seen corresponding path program 1 times [2024-11-12 04:37:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:37:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704999444] [2024-11-12 04:37:53,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:37:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:37:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:37:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:37:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:37:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:37:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:37:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:37:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:37:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:37:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:37:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:37:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:37:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:37:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:37:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:37:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:37:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:53,874 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-12 04:37:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:37:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704999444] [2024-11-12 04:37:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704999444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:37:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:37:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:37:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811568433] [2024-11-12 04:37:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:37:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:37:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:37:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:37:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:37:53,921 INFO L87 Difference]: Start difference. First operand has 57 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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-12 04:37:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:37:53,948 INFO L93 Difference]: Finished difference Result 107 states and 177 transitions. [2024-11-12 04:37:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:37:53,951 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-12 04:37:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:37:53,961 INFO L225 Difference]: With dead ends: 107 [2024-11-12 04:37:53,962 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 04:37:53,966 INFO L434 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-12 04:37:53,972 INFO L435 NwaCegarLoop]: 77 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, 77 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-12 04:37:53,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:37:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 04:37:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-12 04:37:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-12 04:37:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-12 04:37:54,022 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 100 [2024-11-12 04:37:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:37:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-12 04:37:54,024 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-12 04:37:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-12 04:37:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 04:37:54,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:37:54,031 INFO L218 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-12 04:37:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:37:54,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:37:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:37:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1441110923, now seen corresponding path program 1 times [2024-11-12 04:37:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:37:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071759574] [2024-11-12 04:37:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:37:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:37:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:37:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:37:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:37:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:37:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:37:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:37:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:37:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:37:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:37:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:37:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:37:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:37:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:37:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:37:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:37:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 04:37:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:37:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071759574] [2024-11-12 04:37:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071759574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:37:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998752011] [2024-11-12 04:37:55,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:37:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:37:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:37:55,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-12 04:37:55,139 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-12 04:37:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 04:37:55,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:37:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 42 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 04:37:55,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:37:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 04:37:56,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998752011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:37:56,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:37:56,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-12 04:37:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542859429] [2024-11-12 04:37:56,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:37:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 04:37:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:37:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 04:37:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:37:56,261 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 04:37:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:37:56,709 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2024-11-12 04:37:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:37:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 100 [2024-11-12 04:37:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:37:56,713 INFO L225 Difference]: With dead ends: 115 [2024-11-12 04:37:56,713 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 04:37:56,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2024-11-12 04:37:56,718 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 103 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:37:56,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 158 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:37:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 04:37:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-11-12 04:37:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:37:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-11-12 04:37:56,733 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 100 [2024-11-12 04:37:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:37:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-11-12 04:37:56,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 04:37:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-11-12 04:37:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 04:37:56,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:37:56,736 INFO L218 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-12 04:37:56,755 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-12 04:37:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:37:56,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:37:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:37:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1699276361, now seen corresponding path program 1 times [2024-11-12 04:37:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:37:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784191493] [2024-11-12 04:37:56,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:37:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:37:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:37:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901661263] [2024-11-12 04:37:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:37:57,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:37:57,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:37:57,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:37:57,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:37:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:37:57,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 04:37:57,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:38:01,648 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_z_5 Int) (v_y_5 Int)) (let ((.cse0 (+ (* v_z_5 65535) (* 65536 v_y_5)))) (and (<= 0 .cse0) (<= v_z_5 65535) (= |c_ULTIMATE.start_step_#t~bitwise4#1| (+ (* (* v_z_5 v_z_5) 4294836225) (* (* v_z_5 v_y_5) 8589803520) (* (* v_y_5 v_y_5) 4294967296))) (<= 65473 v_z_5) (<= .cse0 32767)))) (= |c_ULTIMATE.start_step_#t~bitwise4#1| 0)) is different from true [2024-11-12 04:38:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-12 04:38:01,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:38:01,866 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-12 04:38:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:38:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784191493] [2024-11-12 04:38:01,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 04:38:01,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901661263] [2024-11-12 04:38:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901661263] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 04:38:01,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 04:38:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-11-12 04:38:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901535399] [2024-11-12 04:38:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:38:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:38:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:38:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:38:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-12 04:38:01,870 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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-12 04:38:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:38:01,937 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2024-11-12 04:38:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:38:01,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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 100 [2024-11-12 04:38:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:38:01,940 INFO L225 Difference]: With dead ends: 157 [2024-11-12 04:38:01,940 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 04:38:01,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=34, Invalid=125, Unknown=1, NotChecked=22, Total=182 [2024-11-12 04:38:01,966 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:38:01,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 251 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:38:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 04:38:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2024-11-12 04:38:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:38:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-11-12 04:38:01,989 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 100 [2024-11-12 04:38:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:38:01,990 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-11-12 04:38:01,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (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-12 04:38:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-11-12 04:38:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 04:38:01,994 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:38:01,995 INFO L218 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-12 04:38:02,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:38:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 04:38:02,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:38:02,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:38:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1915632565, now seen corresponding path program 1 times [2024-11-12 04:38:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:38:02,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74082376] [2024-11-12 04:38:02,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:38:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:38:02,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604176332] [2024-11-12 04:38:02,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:02,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:38:02,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:38:02,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:38:02,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 04:38:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:38:02,414 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:38:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:38:02,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:38:02,493 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:38:02,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:38:02,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 04:38:02,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:38:02,700 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 04:38:02,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:38:02,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:38:02 BoogieIcfgContainer [2024-11-12 04:38:02,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:38:02,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:38:02,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:38:02,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:38:02,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:37:53" (3/4) ... [2024-11-12 04:38:02,788 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:38:02,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:38:02,790 INFO L158 Benchmark]: Toolchain (without parser) took 10415.52ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 124.3MB in the beginning and 124.5MB in the end (delta: -193.5kB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,790 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:38:02,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.65ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 109.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.17ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,791 INFO L158 Benchmark]: Boogie Preprocessor took 65.91ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 103.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,792 INFO L158 Benchmark]: RCFGBuilder took 575.49ms. Allocated memory is still 157.3MB. Free memory was 103.4MB in the beginning and 116.2MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,792 INFO L158 Benchmark]: TraceAbstraction took 9398.17ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 115.2MB in the beginning and 125.5MB in the end (delta: -10.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-12 04:38:02,792 INFO L158 Benchmark]: Witness Printer took 8.17ms. Allocated memory is still 195.0MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:38:02,794 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.10ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.65ms. Allocated memory is still 157.3MB. Free memory was 124.3MB in the beginning and 109.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.17ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.91ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 103.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 575.49ms. Allocated memory is still 157.3MB. Free memory was 103.4MB in the beginning and 116.2MB in the end (delta: -12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9398.17ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 115.2MB in the beginning and 125.5MB in the end (delta: -10.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 8.17ms. Allocated memory is still 195.0MB. Free memory is still 124.5MB. 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 someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_3 = 100; [L25] unsigned char var_1_6 = 16; [L26] signed char var_1_7 = -25; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 25; [L29] signed char var_1_10 = -10; [L30] signed char var_1_11 = 0; [L31] float var_1_12 = 25.1; [L32] unsigned long int var_1_13 = 2531521428; [L33] signed long int var_1_14 = -128; [L34] signed long int var_1_15 = 256; [L35] signed short int var_1_16 = -16; VAL [isInitial=0, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=59049, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L72] var_1_8 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && 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=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L82] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L39] var_1_14 = var_1_8 [L40] var_1_16 = var_1_14 [L41] signed long int stepLocal_0 = (((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)); VAL [isInitial=1, stepLocal_0=63, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L42] COND FALSE !(var_1_2 <= stepLocal_0) [L45] var_1_7 = var_1_10 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L47] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] COND FALSE !(((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L54] COND TRUE 2.75f > var_1_12 [L55] var_1_11 = (var_1_10 + var_1_8) VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L90-L91] return ((((((((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_2 <= ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_7 == ((signed char) ((var_1_8 - (1 + var_1_9)) + var_1_10))) : (var_1_7 == ((signed char) var_1_10)))) && ((2.75f > var_1_12) ? (var_1_11 == ((signed char) (var_1_10 + var_1_8))) : (((var_1_13 - ((((var_1_14) > (var_1_8)) ? (var_1_14) : (var_1_8)))) > var_1_1) ? (var_1_11 == ((signed char) ((((((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) < (var_1_10)) ? (((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) : (var_1_10))))) : 1))) && (var_1_14 == ((signed long int) var_1_8))) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_14)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 227 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 594 ConstructedInterpolants, 1 QuantifiedInterpolants, 2293 SizeOfPredicates, 6 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2352/2520 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-12 04:38:02,824 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-37.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 26fb43b660eb5bfaf25248556887d19789383a6fa9c06b78f25f9a13c404f1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:38:05,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:38:05,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:38:05,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:38:05,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:38:05,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:38:05,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:38:05,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:38:05,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:38:05,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:38:05,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:38:05,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:38:05,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:38:05,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:38:05,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:38:05,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:38:05,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:38:05,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:38:05,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:38:05,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:38:05,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:38:05,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:38:05,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:38:05,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:38:05,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:38:05,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:38:05,266 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:38:05,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:38:05,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:38:05,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:38:05,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:38:05,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:38:05,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:38:05,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:38:05,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:38:05,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:38:05,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:38:05,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:38:05,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:38:05,271 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:38:05,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:38:05,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:38:05,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:38:05,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:38:05,273 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 -> 26fb43b660eb5bfaf25248556887d19789383a6fa9c06b78f25f9a13c404f1a7 [2024-11-12 04:38:05,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:38:05,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:38:05,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:38:05,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:38:05,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:38:05,677 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-37.i [2024-11-12 04:38:07,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:38:07,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:38:07,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-37.i [2024-11-12 04:38:07,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b66c448/0f1baa32e8cf4a4b99c0ff2084b41e91/FLAG9eeb15b8e [2024-11-12 04:38:07,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61b66c448/0f1baa32e8cf4a4b99c0ff2084b41e91 [2024-11-12 04:38:07,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:38:07,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:38:07,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:38:07,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:38:07,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:38:07,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127d7b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07, skipping insertion in model container [2024-11-12 04:38:07,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:38:07,706 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-37.i[917,930] [2024-11-12 04:38:07,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:38:07,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:38:07,808 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-37.i[917,930] [2024-11-12 04:38:07,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:38:07,873 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:38:07,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07 WrapperNode [2024-11-12 04:38:07,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:38:07,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:38:07,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:38:07,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:38:07,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,946 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-12 04:38:07,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:38:07,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:38:07,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:38:07,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:38:07,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,982 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-12 04:38:07,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:07,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:08,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:08,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:08,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:08,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:38:08,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:38:08,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:38:08,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:38:08,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (1/1) ... [2024-11-12 04:38:08,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:38:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:38:08,057 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-12 04:38:08,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:38:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:38:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:38:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:38:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:38:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:38:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:38:08,206 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:38:08,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:38:08,490 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:38:08,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:38:08,502 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:38:08,502 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:38:08,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:38:08 BoogieIcfgContainer [2024-11-12 04:38:08,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:38:08,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:38:08,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:38:08,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:38:08,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:38:07" (1/3) ... [2024-11-12 04:38:08,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb881d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:38:08, skipping insertion in model container [2024-11-12 04:38:08,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:38:07" (2/3) ... [2024-11-12 04:38:08,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb881d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:38:08, skipping insertion in model container [2024-11-12 04:38:08,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:38:08" (3/3) ... [2024-11-12 04:38:08,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-37.i [2024-11-12 04:38:08,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:38:08,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:38:08,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:38:08,608 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;@116b034e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:38:08,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:38:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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-12 04:38:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 04:38:08,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:38:08,625 INFO L218 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] [2024-11-12 04:38:08,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:38:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:38:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 893252525, now seen corresponding path program 1 times [2024-11-12 04:38:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:38:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470569686] [2024-11-12 04:38:08,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:08,646 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-12 04:38:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:38:08,650 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-12 04:38:08,651 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-12 04:38:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:38:08,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:38:08,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:38:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-12 04:38:08,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:38:08,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:38:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470569686] [2024-11-12 04:38:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470569686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:38:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:38:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:38:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936275585] [2024-11-12 04:38:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:38:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:38:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:38:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:38:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:38:08,969 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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.5) internal successors, (29), 2 states have internal predecessors, (29), 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-12 04:38:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:38:08,990 INFO L93 Difference]: Finished difference Result 89 states and 147 transitions. [2024-11-12 04:38:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:38:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 97 [2024-11-12 04:38:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:38:08,999 INFO L225 Difference]: With dead ends: 89 [2024-11-12 04:38:09,000 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 04:38:09,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-12 04:38:09,008 INFO L435 NwaCegarLoop]: 62 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, 62 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-12 04:38:09,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:38:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 04:38:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-12 04:38:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-12 04:38:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-12 04:38:09,051 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 97 [2024-11-12 04:38:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:38:09,051 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-12 04:38:09,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-12 04:38:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-12 04:38:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 04:38:09,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:38:09,056 INFO L218 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] [2024-11-12 04:38:09,062 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-12 04:38:09,257 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-12 04:38:09,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:38:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:38:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash -664290645, now seen corresponding path program 1 times [2024-11-12 04:38:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:38:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098184360] [2024-11-12 04:38:09,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:09,260 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-12 04:38:09,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:38:09,261 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-12 04:38:09,263 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-12 04:38:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:38:09,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 04:38:09,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:38:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-12 04:38:10,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:38:10,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:38:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098184360] [2024-11-12 04:38:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098184360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:38:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370854369] [2024-11-12 04:38:10,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:10,422 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:38:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:38:10,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:38:10,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 04:38:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:38:10,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 04:38:10,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:38:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-12 04:38:11,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:38:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1370854369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:38:11,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:38:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-12 04:38:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348800046] [2024-11-12 04:38:11,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:38:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:38:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:38:11,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:38:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:38:11,205 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 04:38:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:38:11,692 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-11-12 04:38:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:38:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 97 [2024-11-12 04:38:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:38:11,695 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:38:11,695 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 04:38:11,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:38:11,699 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:38:11,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:38:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 04:38:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-12 04:38:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 04:38:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-12 04:38:11,721 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 97 [2024-11-12 04:38:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:38:11,723 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-12 04:38:11,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 04:38:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-12 04:38:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 04:38:11,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:38:11,725 INFO L218 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] [2024-11-12 04:38:11,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-12 04:38:11,933 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-12 04:38:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-12 04:38:12,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:38:12,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:38:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash 15767725, now seen corresponding path program 1 times [2024-11-12 04:38:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:38:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212074966] [2024-11-12 04:38:12,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:12,130 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-12 04:38:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:38:12,134 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 04:38:12,138 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 (5)] Waiting until timeout for monitored process [2024-11-12 04:38:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:38:12,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 04:38:12,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:38:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 222 proven. 102 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-12 04:38:13,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:38:16,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:38:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212074966] [2024-11-12 04:38:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212074966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:38:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2068264239] [2024-11-12 04:38:16,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:38:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 04:38:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 04:38:16,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 04:38:16,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 04:38:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:38:17,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 04:38:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates...