./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:44:50,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:44:50,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:44:50,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:44:50,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:44:50,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:44:50,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:44:50,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:44:50,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:44:50,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:44:50,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:44:50,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:44:50,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:44:50,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:44:50,469 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:44:50,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:44:50,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:44:50,475 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:44:50,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:44:50,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:44:50,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:44:50,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:44:50,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:44:50,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:44:50,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:44:50,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:44:50,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:44:50,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:44:50,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:44:50,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:44:50,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:44:50,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:44:50,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:50,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:44:50,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:44:50,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:44:50,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:44:50,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:44:50,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:44:50,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:44:50,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:44:50,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:44:50,483 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-clean/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-clean/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 -> 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 [2024-10-11 10:44:50,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:44:50,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:44:50,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:44:50,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:44:50,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:44:50,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:44:52,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:44:52,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:44:52,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:44:52,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e54731797/c6bee64b115548b39a4b88a7e7b46809/FLAG325dbcd00 [2024-10-11 10:44:52,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e54731797/c6bee64b115548b39a4b88a7e7b46809 [2024-10-11 10:44:52,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:44:52,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:44:52,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:52,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:44:52,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:44:52,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c05b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52, skipping insertion in model container [2024-10-11 10:44:52,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:44:52,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-10-11 10:44:52,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:52,794 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:44:52,806 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-10-11 10:44:52,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:52,859 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:44:52,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52 WrapperNode [2024-10-11 10:44:52,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:52,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:52,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:44:52,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:44:52,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,928 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-11 10:44:52,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:52,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:44:52,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:44:52,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:44:52,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:44:52,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:44:52,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:44:52,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:44:52,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:44:52,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (1/1) ... [2024-10-11 10:44:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:53,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:53,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:44:53,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:44:53,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:44:53,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:44:53,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:44:53,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:44:53,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:44:53,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:44:53,183 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:44:53,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:44:53,491 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:44:53,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:44:53,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:44:53,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:44:53,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:53 BoogieIcfgContainer [2024-10-11 10:44:53,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:44:53,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:44:53,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:44:53,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:44:53,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:44:52" (1/3) ... [2024-10-11 10:44:53,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad4332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:53, skipping insertion in model container [2024-10-11 10:44:53,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:52" (2/3) ... [2024-10-11 10:44:53,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad4332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:53, skipping insertion in model container [2024-10-11 10:44:53,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:53" (3/3) ... [2024-10-11 10:44:53,550 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:44:53,568 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:44:53,569 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:44:53,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:44:53,646 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;@1cbe46ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:44:53,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:44:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:44:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:44:53,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:53,668 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:53,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash 214184693, now seen corresponding path program 1 times [2024-10-11 10:44:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380398557] [2024-10-11 10:44:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:44:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:44:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:44:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:44:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:44:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:44:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:44:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:44:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:44:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:44:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:44:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:44:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:44:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:44:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:44:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:44:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:44:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 10:44:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380398557] [2024-10-11 10:44:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380398557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:54,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:54,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:44:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611886585] [2024-10-11 10:44:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:44:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:44:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:54,341 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:44:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:54,387 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2024-10-11 10:44:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:44:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2024-10-11 10:44:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:54,398 INFO L225 Difference]: With dead ends: 111 [2024-10-11 10:44:54,398 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 10:44:54,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:54,408 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:54,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 10:44:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 10:44:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:44:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-10-11 10:44:54,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 144 [2024-10-11 10:44:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:54,451 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-10-11 10:44:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:44:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-10-11 10:44:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:44:54,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:54,454 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:54,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:44:54,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -190037779, now seen corresponding path program 1 times [2024-10-11 10:44:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066259912] [2024-10-11 10:44:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:44:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:44:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:44:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:44:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:44:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:44:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:44:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:44:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:44:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:44:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:44:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:44:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:44:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:44:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:44:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:44:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:44:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 10:44:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:54,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066259912] [2024-10-11 10:44:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066259912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607997801] [2024-10-11 10:44:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:54,752 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 10:44:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:54,819 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-11 10:44:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-11 10:44:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:54,824 INFO L225 Difference]: With dead ends: 141 [2024-10-11 10:44:54,824 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 10:44:54,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:54,826 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:54,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 10:44:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-11 10:44:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 10:44:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-11 10:44:54,863 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 144 [2024-10-11 10:44:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-11 10:44:54,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 10:44:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-11 10:44:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:44:54,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:54,869 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:54,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:44:54,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:54,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash -189978197, now seen corresponding path program 1 times [2024-10-11 10:44:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340620501] [2024-10-11 10:44:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:44:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:44:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:44:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:44:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:44:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:44:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:44:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:44:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:44:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:44:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:44:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:44:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:44:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:44:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:44:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:44:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:44:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:44:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:44:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:44:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:44:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-11 10:44:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340620501] [2024-10-11 10:44:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340620501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19703535] [2024-10-11 10:44:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:44:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:55,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:44:55,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:44:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:56,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 10:44:56,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 252 proven. 228 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-11 10:44:57,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 10:44:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19703535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:44:57,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:44:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 19 [2024-10-11 10:44:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791617068] [2024-10-11 10:44:57,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:44:57,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 10:44:57,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:57,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 10:44:57,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:44:57,758 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) [2024-10-11 10:44:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:58,322 INFO L93 Difference]: Finished difference Result 197 states and 269 transitions. [2024-10-11 10:44:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 10:44:58,324 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) Word has length 144 [2024-10-11 10:44:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:58,331 INFO L225 Difference]: With dead ends: 197 [2024-10-11 10:44:58,331 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 10:44:58,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 320 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2024-10-11 10:44:58,336 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 78 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:58,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 227 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:44:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 10:44:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2024-10-11 10:44:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 64 states have internal predecessors, (68), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 10:44:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2024-10-11 10:44:58,373 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 144 [2024-10-11 10:44:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:58,376 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2024-10-11 10:44:58,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (47), 4 states have call predecessors, (47), 8 states have return successors, (49), 4 states have call predecessors, (49), 5 states have call successors, (49) [2024-10-11 10:44:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2024-10-11 10:44:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:44:58,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:58,379 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:58,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:44:58,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:44:58,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:58,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash -999324823, now seen corresponding path program 1 times [2024-10-11 10:44:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:58,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409046367] [2024-10-11 10:44:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:58,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:58,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:44:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:58,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:44:58,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:44:58,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:44:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:44:58,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 10:44:58,910 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:44:58,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:44:58 BoogieIcfgContainer [2024-10-11 10:44:58,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:44:58,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:44:58,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:44:58,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:44:58,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:53" (3/4) ... [2024-10-11 10:44:58,917 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:44:58,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:44:58,919 INFO L158 Benchmark]: Toolchain (without parser) took 6425.05ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 122.1MB in the beginning and 166.4MB in the end (delta: -44.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-10-11 10:44:58,920 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:58,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.60ms. Allocated memory is still 176.2MB. Free memory was 122.1MB in the beginning and 107.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:44:58,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.85ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 103.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:58,921 INFO L158 Benchmark]: Boogie Preprocessor took 59.75ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 99.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:44:58,922 INFO L158 Benchmark]: RCFGBuilder took 545.98ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 76.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:58,923 INFO L158 Benchmark]: TraceAbstraction took 5374.39ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 75.9MB in the beginning and 166.4MB in the end (delta: -90.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:58,923 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 251.7MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:58,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.60ms. Allocated memory is still 176.2MB. Free memory was 122.1MB in the beginning and 107.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.85ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 103.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.75ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 99.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 545.98ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 76.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5374.39ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 75.9MB in the beginning and 166.4MB in the end (delta: -90.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 251.7MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; [L38] unsigned short int var_1_17 = 25; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_ushort() [L66] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] var_1_3 = __VERIFIER_nondet_ushort() [L69] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L74] var_1_6 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L75] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L80] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L82] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L84] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L88] var_1_14 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L95] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L97] var_1_18 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L98] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L100] var_1_19 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L101] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L115] RET updateVariables() [L116] CALL step() [L44] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L45] unsigned short int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=32767, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L46] COND FALSE !(var_1_4 > stepLocal_0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L49] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L50] COND TRUE ! var_1_13 [L51] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, stepLocal_1=-255, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L60] COND FALSE !((var_1_13 && var_1_18) && stepLocal_1) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))) && (((var_1_13 && var_1_18) && var_1_19) ? (var_1_17 == ((unsigned short int) (var_1_15 + var_1_14))) : 1) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_16=-49152, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-2147385345, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 455 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 393 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 212 mSDtfsCounter, 393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 444 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 23, 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 4204 SizeOfPredicates, 5 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5049/5520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:44:58,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:45:01,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:45:01,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:45:01,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:45:01,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:45:01,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:45:01,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:45:01,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:45:01,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:45:01,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:45:01,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:45:01,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:45:01,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:45:01,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:45:01,216 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:45:01,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:45:01,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:45:01,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:45:01,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:45:01,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:45:01,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:45:01,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:45:01,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:45:01,223 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:45:01,223 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:45:01,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:45:01,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:45:01,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:45:01,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:45:01,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:45:01,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:45:01,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:45:01,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:45:01,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:45:01,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:45:01,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:45:01,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:45:01,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:45:01,227 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:45:01,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:45:01,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:45:01,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:45:01,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:45:01,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:45:01,229 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:45:01,230 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-clean/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-clean/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 -> 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 [2024-10-11 10:45:01,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:45:01,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:45:01,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:45:01,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:45:01,586 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:45:01,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:45:03,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:45:03,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:45:03,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:45:03,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6e5bda5bb/0e60ae7fe36a4a6cbbf2ef8a45731758/FLAGac50c1331 [2024-10-11 10:45:03,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6e5bda5bb/0e60ae7fe36a4a6cbbf2ef8a45731758 [2024-10-11 10:45:03,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:45:03,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:45:03,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:45:03,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:45:03,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:45:03,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:45:03" (1/1) ... [2024-10-11 10:45:03,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f525b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:03, skipping insertion in model container [2024-10-11 10:45:03,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:45:03" (1/1) ... [2024-10-11 10:45:03,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:45:03,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-10-11 10:45:03,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:45:03,996 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:45:04,010 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-10-11 10:45:04,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:45:04,077 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:45:04,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04 WrapperNode [2024-10-11 10:45:04,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:45:04,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:45:04,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:45:04,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:45:04,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,137 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-11 10:45:04,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:45:04,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:45:04,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:45:04,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:45:04,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:45:04,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:45:04,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:45:04,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:45:04,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:45:04,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (1/1) ... [2024-10-11 10:45:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:45:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:45:04,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:45:04,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:45:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:45:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:45:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:45:04,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:45:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:45:04,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:45:04,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:45:04,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:45:07,202 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:45:07,202 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:45:07,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:45:07,299 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:45:07,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:45:07 BoogieIcfgContainer [2024-10-11 10:45:07,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:45:07,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:45:07,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:45:07,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:45:07,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:45:03" (1/3) ... [2024-10-11 10:45:07,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f329f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:45:07, skipping insertion in model container [2024-10-11 10:45:07,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:45:04" (2/3) ... [2024-10-11 10:45:07,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f329f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:45:07, skipping insertion in model container [2024-10-11 10:45:07,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:45:07" (3/3) ... [2024-10-11 10:45:07,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-38.i [2024-10-11 10:45:07,329 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:45:07,330 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:45:07,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:45:07,423 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;@75e4acca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:45:07,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:45:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:45:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:45:07,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:45:07,444 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:45:07,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:45:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:45:07,451 INFO L85 PathProgramCache]: Analyzing trace with hash 214184693, now seen corresponding path program 1 times [2024-10-11 10:45:07,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:45:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83881988] [2024-10-11 10:45:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:45:07,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:45:07,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:45:07,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:45:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:45:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:45:07,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:45:07,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:45:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2024-10-11 10:45:07,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:45:07,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:45:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83881988] [2024-10-11 10:45:07,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83881988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:45:07,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:45:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:45:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793894773] [2024-10-11 10:45:07,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:45:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:45:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:45:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:45:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:45:07,938 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:45:10,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:45:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:45:10,069 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2024-10-11 10:45:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:45:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2024-10-11 10:45:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:45:10,101 INFO L225 Difference]: With dead ends: 111 [2024-10-11 10:45:10,101 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 10:45:10,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:45:10,107 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:45:10,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 10:45:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 10:45:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 10:45:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 10:45:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-10-11 10:45:10,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 144 [2024-10-11 10:45:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:45:10,160 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-10-11 10:45:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 10:45:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-10-11 10:45:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:45:10,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:45:10,164 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:45:10,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:45:10,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:45:10,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:45:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:45:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -190037779, now seen corresponding path program 1 times [2024-10-11 10:45:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:45:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399524929] [2024-10-11 10:45:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:45:10,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:45:10,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:45:10,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:45:10,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:45:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:45:10,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:45:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:45:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 10:45:10,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:45:10,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:45:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399524929] [2024-10-11 10:45:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399524929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:45:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:45:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:45:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513110697] [2024-10-11 10:45:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:45:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:45:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:45:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:45:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:45:10,806 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 10:45:12,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:45:14,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:45:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:45:14,376 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-11 10:45:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:45:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-11 10:45:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:45:14,380 INFO L225 Difference]: With dead ends: 141 [2024-10-11 10:45:14,380 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 10:45:14,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:45:14,382 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:45:14,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 148 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 10:45:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 10:45:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-11 10:45:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 10:45:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-11 10:45:14,406 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 144 [2024-10-11 10:45:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:45:14,407 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-11 10:45:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 10:45:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-11 10:45:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 10:45:14,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:45:14,410 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:45:14,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:45:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:45:14,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:45:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:45:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -189978197, now seen corresponding path program 1 times [2024-10-11 10:45:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:45:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612808770] [2024-10-11 10:45:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:45:14,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:45:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:45:14,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:45:14,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:45:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:45:15,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 10:45:15,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:45:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 339 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-11 10:45:47,983 INFO L311 TraceCheckSpWp]: Computing backward predicates...