./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-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:09:25,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:25,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:09:25,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:25,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:25,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:25,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:25,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:25,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:25,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:25,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:25,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:25,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:25,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:25,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:25,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:25,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:25,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:25,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:09:25,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:25,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:25,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:25,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:25,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:25,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:25,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:25,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:25,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:25,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:25,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:25,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:25,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:25,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:25,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:25,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:25,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:25,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:09:25,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:09:25,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:25,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:25,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:25,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:25,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2024-10-24 05:09:25,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:25,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:25,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:25,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:25,714 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:25,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:27,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:27,343 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:27,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:27,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4794544/0e4de79a913f480b96b2d806878fc2e4/FLAG88a1b4c87 [2024-10-24 05:09:27,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff4794544/0e4de79a913f480b96b2d806878fc2e4 [2024-10-24 05:09:27,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:27,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:27,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:27,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:27,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:27,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a0dca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27, skipping insertion in model container [2024-10-24 05:09:27,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:27,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:27,900 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-54.i[919,932] [2024-10-24 05:09:27,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:27,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:27,960 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-54.i[919,932] [2024-10-24 05:09:27,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:27,991 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:27,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27 WrapperNode [2024-10-24 05:09:27,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:27,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:27,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:27,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:27,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,031 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-10-24 05:09:28,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:28,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:28,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:28,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:28,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,055 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-24 05:09:28,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:28,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:28,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:28,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:28,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (1/1) ... [2024-10-24 05:09:28,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:28,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:28,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:09:28,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:09:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:09:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:28,203 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:28,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:28,515 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:28,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:28,655 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:28,655 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:28 BoogieIcfgContainer [2024-10-24 05:09:28,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:28,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:28,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:28,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:28,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:27" (1/3) ... [2024-10-24 05:09:28,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370d8918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:28, skipping insertion in model container [2024-10-24 05:09:28,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:27" (2/3) ... [2024-10-24 05:09:28,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370d8918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:28, skipping insertion in model container [2024-10-24 05:09:28,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:28" (3/3) ... [2024-10-24 05:09:28,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:28,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:28,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:28,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:28,756 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;@4ef2bdb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:28,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:09:28,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:28,778 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:28,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 185718518, now seen corresponding path program 1 times [2024-10-24 05:09:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:28,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159494710] [2024-10-24 05:09:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:09:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:09:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:09:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:09:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:09:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:09:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:09:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:09:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:09:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159494710] [2024-10-24 05:09:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159494710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:29,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114558398] [2024-10-24 05:09:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:29,173 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:29,213 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-10-24 05:09:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:29,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2024-10-24 05:09:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:29,233 INFO L225 Difference]: With dead ends: 107 [2024-10-24 05:09:29,233 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 05:09:29,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:29,241 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:29,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:09:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 05:09:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 05:09:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-24 05:09:29,283 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 129 [2024-10-24 05:09:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:29,284 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-24 05:09:29,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-24 05:09:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:09:29,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:29,288 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:09:29,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:29,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1582845832, now seen corresponding path program 1 times [2024-10-24 05:09:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347172060] [2024-10-24 05:09:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:09:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:09:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:09:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:09:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:09:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:09:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:09:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:09:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:09:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:09:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:09:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:09:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:09:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:09:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:09:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:09:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:09:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 05:09:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347172060] [2024-10-24 05:09:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347172060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:29,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:29,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:09:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677600239] [2024-10-24 05:09:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:29,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:29,715 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:29,850 INFO L93 Difference]: Finished difference Result 158 states and 242 transitions. [2024-10-24 05:09:29,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:09:29,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2024-10-24 05:09:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:29,852 INFO L225 Difference]: With dead ends: 158 [2024-10-24 05:09:29,852 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 05:09:29,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:09:29,854 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:29,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:09:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 05:09:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-10-24 05:09:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 05:09:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 141 transitions. [2024-10-24 05:09:29,873 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 141 transitions. Word has length 129 [2024-10-24 05:09:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:29,873 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 141 transitions. [2024-10-24 05:09:29,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 141 transitions. [2024-10-24 05:09:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 05:09:29,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:29,875 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:29,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:09:29,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:29,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash 817759928, now seen corresponding path program 1 times [2024-10-24 05:09:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945547696] [2024-10-24 05:09:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:09:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291630865] [2024-10-24 05:09:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:29,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:29,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:29,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:09:29,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:09:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:30,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:09:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:30,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:09:30,838 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:09:30,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:09:30,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:09:31,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:31,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:09:31,129 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:09:31,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:09:31 BoogieIcfgContainer [2024-10-24 05:09:31,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:09:31,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:09:31,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:09:31,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:09:31,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:28" (3/4) ... [2024-10-24 05:09:31,135 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:09:31,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:09:31,138 INFO L158 Benchmark]: Toolchain (without parser) took 3400.85ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 112.0MB in the end (delta: -14.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:31,139 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:31,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.75ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 82.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:09:31,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.80ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:31,139 INFO L158 Benchmark]: Boogie Preprocessor took 42.46ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 76.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:09:31,139 INFO L158 Benchmark]: RCFGBuilder took 580.72ms. Allocated memory is still 165.7MB. Free memory was 76.8MB in the beginning and 134.6MB in the end (delta: -57.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-10-24 05:09:31,140 INFO L158 Benchmark]: TraceAbstraction took 2474.48ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 112.0MB in the end (delta: 21.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-10-24 05:09:31,140 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 165.7MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:31,141 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.13ms. Allocated memory is still 117.4MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.75ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 82.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.80ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.46ms. Allocated memory is still 165.7MB. Free memory was 80.2MB in the beginning and 76.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.72ms. Allocated memory is still 165.7MB. Free memory was 76.8MB in the beginning and 134.6MB in the end (delta: -57.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2474.48ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 112.0MB in the end (delta: 21.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 165.7MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] unsigned char last_1_var_1_9 = 1; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_9 = var_1_9 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L85] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L86] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L89] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L90] var_1_10 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L92] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L93] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L101] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L102] var_1_16 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L103] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L108] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L109] var_1_20 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L110] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L112] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L114] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L128] RET updateVariables() [L129] CALL step() [L45] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=25, var_1_8=8, var_1_9=1] [L46] COND TRUE var_1_5 == var_1_4 [L47] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=33/4, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L54] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L61] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-4, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L63] COND TRUE var_1_18 > var_1_18 [L64] var_1_1 = ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L68] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L69] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=1, var_1_14=2147483640, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L71] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5))) [L72] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=0, var_1_14=2147483640, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L74] COND FALSE !(((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) [L77] var_1_9 = (! var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=0, var_1_14=2147483640, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=0, var_1_14=2147483640, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=3, var_1_11=-255, var_1_12=0, var_1_13=0, var_1_14=2147483640, var_1_17=2147483648, var_1_18=2, var_1_19=2, var_1_1=-2, var_1_4=0, var_1_5=0, var_1_6=-8, var_1_8=8, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 155 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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-24 05:09:31,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:09:33,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:33,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:09:33,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:33,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:33,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:33,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:33,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:33,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:33,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:33,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:33,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:33,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:33,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:33,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:33,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:33,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:33,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:33,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:33,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:33,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:33,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:33,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:33,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:33,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:33,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:33,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:33,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:33,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:33,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:33,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:33,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:33,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:33,422 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:09:33,422 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:09:33,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:33,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:33,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:33,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:33,424 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:09:33,424 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 280b49e79c262e96fafa88ef875ee20b5e3b800a0199f38613b2668cbb928bf3 [2024-10-24 05:09:33,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:33,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:33,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:33,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:33,726 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:33,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:35,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:35,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:35,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:35,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ada1b4/00d02af64c02466a9821cd836e5087b9/FLAG83839c1aa [2024-10-24 05:09:35,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b3ada1b4/00d02af64c02466a9821cd836e5087b9 [2024-10-24 05:09:35,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:35,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:35,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:35,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:35,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:35,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:35" (1/1) ... [2024-10-24 05:09:35,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bbba31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:35, skipping insertion in model container [2024-10-24 05:09:35,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:35" (1/1) ... [2024-10-24 05:09:35,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:36,066 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-54.i[919,932] [2024-10-24 05:09:36,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:36,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:36,138 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-54.i[919,932] [2024-10-24 05:09:36,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:36,194 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:36,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36 WrapperNode [2024-10-24 05:09:36,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:36,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:36,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:36,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:36,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,230 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-24 05:09:36,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:36,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:36,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:36,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:36,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,260 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-24 05:09:36,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:36,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:36,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:36,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:36,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (1/1) ... [2024-10-24 05:09:36,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:36,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:09:36,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:09:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:09:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:36,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:36,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:39,987 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:39,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:40,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:40,038 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:40 BoogieIcfgContainer [2024-10-24 05:09:40,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:40,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:40,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:40,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:40,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:35" (1/3) ... [2024-10-24 05:09:40,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe5e2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:40, skipping insertion in model container [2024-10-24 05:09:40,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:36" (2/3) ... [2024-10-24 05:09:40,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe5e2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:40, skipping insertion in model container [2024-10-24 05:09:40,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:40" (3/3) ... [2024-10-24 05:09:40,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-54.i [2024-10-24 05:09:40,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:40,068 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:40,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:40,136 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;@7f27accc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:40,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:09:40,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:40,168 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:40,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash 185718518, now seen corresponding path program 1 times [2024-10-24 05:09:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925536282] [2024-10-24 05:09:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:40,189 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-24 05:09:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:40,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:09:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:09:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:40,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:09:40,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-24 05:09:40,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:09:40,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:09:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925536282] [2024-10-24 05:09:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925536282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:40,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254284608] [2024-10-24 05:09:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:40,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:09:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:40,619 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:43,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:09:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:43,570 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-10-24 05:09:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2024-10-24 05:09:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:43,602 INFO L225 Difference]: With dead ends: 107 [2024-10-24 05:09:43,603 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 05:09:43,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:43,607 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:43,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 05:09:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 05:09:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 05:09:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2024-10-24 05:09:43,637 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 129 [2024-10-24 05:09:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:43,637 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2024-10-24 05:09:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2024-10-24 05:09:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:09:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:43,641 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:43,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:09:43,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:09:43,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 192161530, now seen corresponding path program 1 times [2024-10-24 05:09:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861764677] [2024-10-24 05:09:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:43,849 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-24 05:09:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:43,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:09:43,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:09:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:44,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:09:44,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:44,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:09:44,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:09:44,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861764677] [2024-10-24 05:09:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861764677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:09:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397911754] [2024-10-24 05:09:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:09:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:44,528 INFO L87 Difference]: Start difference. First operand 53 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:47,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:09:50,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:09:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:50,292 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2024-10-24 05:09:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:09:50,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2024-10-24 05:09:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:50,335 INFO L225 Difference]: With dead ends: 158 [2024-10-24 05:09:50,335 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 05:09:50,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:09:50,337 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 48 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:50,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 226 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-24 05:09:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 05:09:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-10-24 05:09:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 05:09:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 140 transitions. [2024-10-24 05:09:50,363 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 140 transitions. Word has length 129 [2024-10-24 05:09:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 140 transitions. [2024-10-24 05:09:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2024-10-24 05:09:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 05:09:50,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:50,367 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 05:09:50,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:09:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:09:50,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:50,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1702200006, now seen corresponding path program 1 times [2024-10-24 05:09:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093575522] [2024-10-24 05:09:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:50,577 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-24 05:09:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:50,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:09:50,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:09:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:50,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 05:09:50,910 INFO L278 TraceCheckSpWp]: Computing forward predicates...