./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_codestructure_dependencies_file-48.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_codestructure_dependencies_file-48.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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:09:44,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:09:44,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:09:44,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:09:44,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:09:44,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:09:44,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:09:44,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:09:44,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:09:44,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:09:44,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:09:44,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:09:44,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:09:44,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:09:44,507 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:09:44,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:09:44,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:09:44,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:09:44,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:09:44,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:09:44,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:09:44,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:09:44,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:09:44,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:09:44,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:09:44,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:09:44,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:09:44,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:09:44,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:09:44,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:09:44,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:09:44,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:09:44,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:09:44,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:09:44,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:09:44,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:09:44,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:09:44,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:09:44,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:09:44,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:09:44,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:09:44,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:09:44,518 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-10-11 07:09:44,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:09:44,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:09:44,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:09:44,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:09:44,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:09:44,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-10-11 07:09:46,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:09:46,468 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:09:46,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-10-11 07:09:46,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a17fde67d/dfa3b81c195c4b4e80b2c1288801d504/FLAG4b2839b1d [2024-10-11 07:09:46,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a17fde67d/dfa3b81c195c4b4e80b2c1288801d504 [2024-10-11 07:09:46,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:09:46,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:09:46,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:09:46,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:09:46,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:09:46,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:09:46" (1/1) ... [2024-10-11 07:09:46,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afb69d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:46, skipping insertion in model container [2024-10-11 07:09:46,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:09:46" (1/1) ... [2024-10-11 07:09:46,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:09:47,062 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_codestructure_dependencies_file-48.i[919,932] [2024-10-11 07:09:47,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:09:47,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:09:47,213 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_codestructure_dependencies_file-48.i[919,932] [2024-10-11 07:09:47,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:09:47,253 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:09:47,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47 WrapperNode [2024-10-11 07:09:47,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:09:47,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:09:47,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:09:47,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:09:47,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,307 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-11 07:09:47,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:09:47,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:09:47,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:09:47,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:09:47,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,356 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 07:09:47,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:09:47,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:09:47,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:09:47,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:09:47,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (1/1) ... [2024-10-11 07:09:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:09:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:09:47,425 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 07:09:47,428 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 07:09:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:09:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:09:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:09:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:09:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:09:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:09:47,563 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:09:47,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:09:47,851 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:09:47,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:09:47,911 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:09:47,912 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:09:47,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:09:47 BoogieIcfgContainer [2024-10-11 07:09:47,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:09:47,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:09:47,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:09:47,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:09:47,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:09:46" (1/3) ... [2024-10-11 07:09:47,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9cfab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:09:47, skipping insertion in model container [2024-10-11 07:09:47,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:47" (2/3) ... [2024-10-11 07:09:47,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9cfab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:09:47, skipping insertion in model container [2024-10-11 07:09:47,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:09:47" (3/3) ... [2024-10-11 07:09:47,922 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-10-11 07:09:47,939 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:09:47,940 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:09:48,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:09:48,025 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;@cd2ffd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:09:48,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:09:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 07:09:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 07:09:48,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:09:48,046 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:48,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:09:48,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:09:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1281183833, now seen corresponding path program 1 times [2024-10-11 07:09:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:09:48,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485949491] [2024-10-11 07:09:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:09:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:09:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:09:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:09:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:09:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:09:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:09:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 07:09:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 07:09:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:09:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 07:09:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:09:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:09:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:09:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 07:09:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:09:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 07:09:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:09:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 07:09:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:09:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:09:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:09:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 07:09:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:09:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485949491] [2024-10-11 07:09:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485949491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:09:48,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:09:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:09:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937726581] [2024-10-11 07:09:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:09:48,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:09:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:09:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:09:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:09:48,644 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:09:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:09:48,722 INFO L93 Difference]: Finished difference Result 124 states and 223 transitions. [2024-10-11 07:09:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:09:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-10-11 07:09:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:09:48,736 INFO L225 Difference]: With dead ends: 124 [2024-10-11 07:09:48,737 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 07:09:48,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 07:09:48,746 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:09:48,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:09:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 07:09:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-11 07:09:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 07:09:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-11 07:09:48,796 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 123 [2024-10-11 07:09:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:09:48,798 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-11 07:09:48,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:09:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-11 07:09:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 07:09:48,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:09:48,803 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:09:48,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:09:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:09:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1283030875, now seen corresponding path program 1 times [2024-10-11 07:09:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:09:48,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308108658] [2024-10-11 07:09:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:09:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:09:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:09:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:09:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:09:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:09:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:09:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 07:09:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 07:09:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:09:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 07:09:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:09:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:09:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:09:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 07:09:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:09:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 07:09:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:09:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 07:09:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:09:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:09:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:09:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:09:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 07:09:49,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:09:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308108658] [2024-10-11 07:09:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308108658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:09:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:09:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:09:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124045706] [2024-10-11 07:09:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:09:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:09:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:09:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:09:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:09:49,175 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:09:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:09:49,230 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2024-10-11 07:09:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:09:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-10-11 07:09:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:09:49,236 INFO L225 Difference]: With dead ends: 175 [2024-10-11 07:09:49,236 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 07:09:49,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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 07:09:49,239 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:09:49,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 153 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:09:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 07:09:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-10-11 07:09:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 07:09:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2024-10-11 07:09:49,274 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 123 [2024-10-11 07:09:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:09:49,275 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2024-10-11 07:09:49,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:09:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2024-10-11 07:09:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 07:09:49,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:09:49,278 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:49,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:09:49,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:09:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:09:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1118929590, now seen corresponding path program 1 times [2024-10-11 07:09:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:09:49,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272571508] [2024-10-11 07:09:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:09:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:09:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:09:49,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:09:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:09:49,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:09:49,513 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:09:49,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:09:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:09:49,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:09:49,604 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:09:49,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:09:49 BoogieIcfgContainer [2024-10-11 07:09:49,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:09:49,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:09:49,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:09:49,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:09:49,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:09:47" (3/4) ... [2024-10-11 07:09:49,611 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:09:49,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:09:49,613 INFO L158 Benchmark]: Toolchain (without parser) took 2778.22ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 62.0MB in the end (delta: 49.3MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,614 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 180.4MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:09:49,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.95ms. Allocated memory is still 180.4MB. Free memory was 111.0MB in the beginning and 146.1MB in the end (delta: -35.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.81ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 143.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,617 INFO L158 Benchmark]: Boogie Preprocessor took 66.33ms. Allocated memory is still 180.4MB. Free memory was 143.1MB in the beginning and 137.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,617 INFO L158 Benchmark]: RCFGBuilder took 530.13ms. Allocated memory is still 180.4MB. Free memory was 137.7MB in the beginning and 113.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,618 INFO L158 Benchmark]: TraceAbstraction took 1694.00ms. Allocated memory is still 180.4MB. Free memory was 112.6MB in the beginning and 63.0MB in the end (delta: 49.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,618 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 180.4MB. Free memory was 63.0MB in the beginning and 62.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:09:49,624 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.21ms. Allocated memory is still 180.4MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.95ms. Allocated memory is still 180.4MB. Free memory was 111.0MB in the beginning and 146.1MB in the end (delta: -35.1MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.81ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 143.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.33ms. Allocated memory is still 180.4MB. Free memory was 143.1MB in the beginning and 137.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 530.13ms. Allocated memory is still 180.4MB. Free memory was 137.7MB in the beginning and 113.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1694.00ms. Allocated memory is still 180.4MB. Free memory was 112.6MB in the beginning and 63.0MB in the end (delta: 49.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 180.4MB. Free memory was 63.0MB in the beginning and 62.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L131] last_1_var_1_8 = var_1_8 [L132] last_1_var_1_18 = var_1_18 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] var_1_3 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L111] var_1_9 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L112] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] var_1_11 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] var_1_16 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] var_1_17 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L143] RET updateVariables() [L144] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L54] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L56] COND TRUE var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12))) [L57] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L70] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L71] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L79] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L82] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L85] COND FALSE !(last_1_var_1_18 != var_1_16) [L92] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=65, var_1_15=127, var_1_16=64, var_1_17=65, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 156 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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 07:09:49,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_codestructure_dependencies_file-48.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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:09:51,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:09:52,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:09:52,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:09:52,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:09:52,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:09:52,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:09:52,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:09:52,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:09:52,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:09:52,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:09:52,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:09:52,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:09:52,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:09:52,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:09:52,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:09:52,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:09:52,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:09:52,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:09:52,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:09:52,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:09:52,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:09:52,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:09:52,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:09:52,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:09:52,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:09:52,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:09:52,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:09:52,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:09:52,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:09:52,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:09:52,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:09:52,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:09:52,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:09:52,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:09:52,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:09:52,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:09:52,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:09:52,081 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:09:52,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:09:52,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:09:52,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:09:52,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:09:52,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:09:52,083 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:09:52,083 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-10-11 07:09:52,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:09:52,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:09:52,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:09:52,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:09:52,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:09:52,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-10-11 07:09:54,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:09:54,343 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:09:54,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-10-11 07:09:54,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a71adad40/b13ba38f1d0a463bac3e2e2a1286da0c/FLAG68a2bb584 [2024-10-11 07:09:54,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a71adad40/b13ba38f1d0a463bac3e2e2a1286da0c [2024-10-11 07:09:54,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:09:54,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:09:54,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:09:54,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:09:54,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:09:54,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789ea36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54, skipping insertion in model container [2024-10-11 07:09:54,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:09:54,592 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_codestructure_dependencies_file-48.i[919,932] [2024-10-11 07:09:54,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:09:54,701 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:09:54,713 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_codestructure_dependencies_file-48.i[919,932] [2024-10-11 07:09:54,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:09:54,776 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:09:54,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54 WrapperNode [2024-10-11 07:09:54,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:09:54,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:09:54,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:09:54,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:09:54,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,835 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-11 07:09:54,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:09:54,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:09:54,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:09:54,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:09:54,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,866 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 07:09:54,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:09:54,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:09:54,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:09:54,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:09:54,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (1/1) ... [2024-10-11 07:09:54,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:09:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:09:54,921 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 07:09:54,927 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 07:09:54,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:09:54,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:09:54,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:09:54,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:09:54,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:09:54,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:09:55,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:09:55,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:10:19,093 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:10:19,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:10:19,167 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:10:19,167 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:10:19,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:10:19 BoogieIcfgContainer [2024-10-11 07:10:19,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:10:19,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:10:19,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:10:19,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:10:19,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:09:54" (1/3) ... [2024-10-11 07:10:19,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2a417b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:10:19, skipping insertion in model container [2024-10-11 07:10:19,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:09:54" (2/3) ... [2024-10-11 07:10:19,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2a417b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:10:19, skipping insertion in model container [2024-10-11 07:10:19,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:10:19" (3/3) ... [2024-10-11 07:10:19,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-10-11 07:10:19,197 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:10:19,197 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:10:19,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:10:19,272 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;@31535222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:10:19,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:10:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 07:10:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 07:10:19,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:10:19,291 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:19,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:10:19,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:10:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1281183833, now seen corresponding path program 1 times [2024-10-11 07:10:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:10:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752411806] [2024-10-11 07:10:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:10:19,312 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 07:10:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:10:19,316 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 07:10:19,327 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 07:10:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:10:20,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:10:20,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:10:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 07:10:21,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:10:21,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:10:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752411806] [2024-10-11 07:10:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752411806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:10:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:10:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:10:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463476044] [2024-10-11 07:10:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:10:21,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:10:21,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:10:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:10:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:10:21,090 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:10:25,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:30,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:34,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:10:34,626 INFO L93 Difference]: Finished difference Result 124 states and 223 transitions. [2024-10-11 07:10:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:10:34,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-10-11 07:10:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:10:34,640 INFO L225 Difference]: With dead ends: 124 [2024-10-11 07:10:34,640 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 07:10:34,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:10:34,647 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:10:34,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 150 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2024-10-11 07:10:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 07:10:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-11 07:10:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 07:10:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-11 07:10:34,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 123 [2024-10-11 07:10:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:10:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-11 07:10:34,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:10:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-11 07:10:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 07:10:34,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:10:34,693 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:34,730 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 07:10:34,894 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 07:10:34,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:10:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:10:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1283030875, now seen corresponding path program 1 times [2024-10-11 07:10:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:10:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508134996] [2024-10-11 07:10:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:10:34,897 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 07:10:34,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:10:34,900 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 07:10:34,902 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 07:10:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:10:36,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:10:36,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:10:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 07:10:41,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:10:41,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:10:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508134996] [2024-10-11 07:10:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508134996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:10:41,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:10:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:10:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171485829] [2024-10-11 07:10:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:10:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:10:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:10:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:10:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:10:41,526 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:10:46,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:50,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:54,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:10:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:10:54,988 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2024-10-11 07:10:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:10:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-10-11 07:10:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:10:54,991 INFO L225 Difference]: With dead ends: 175 [2024-10-11 07:10:54,991 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 07:10:54,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:10:54,993 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:10:54,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 153 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2024-10-11 07:10:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 07:10:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-10-11 07:10:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 07:10:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2024-10-11 07:10:55,017 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 123 [2024-10-11 07:10:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:10:55,018 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2024-10-11 07:10:55,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 07:10:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2024-10-11 07:10:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 07:10:55,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:10:55,020 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:55,059 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 07:10:55,221 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 07:10:55,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:10:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:10:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1118929590, now seen corresponding path program 1 times [2024-10-11 07:10:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:10:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301609641] [2024-10-11 07:10:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:10:55,223 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 07:10:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:10:55,226 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 07:10:55,227 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 07:10:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:10:56,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 07:10:56,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:11:12,883 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 07:11:21,468 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)