./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_steplocals_file-42.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_steplocals_file-42.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 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:31:51,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:31:51,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:31:51,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:31:51,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:31:51,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:31:51,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:31:51,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:31:51,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:31:51,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:31:51,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:31:51,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:31:51,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:31:51,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:31:51,490 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:31:51,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:31:51,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:31:51,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:31:51,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:31:51,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:31:51,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:31:51,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:31:51,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:31:51,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:31:51,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:31:51,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:31:51,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:31:51,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:31:51,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:31:51,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:31:51,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:31:51,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:31:51,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:51,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:31:51,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:31:51,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:31:51,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:31:51,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:31:51,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:31:51,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:31:51,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:31:51,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:31:51,502 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 -> 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 [2024-10-24 05:31:51,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:31:51,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:31:51,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:31:51,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:31:51,763 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:31:51,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-10-24 05:31:53,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:31:53,375 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:31:53,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-10-24 05:31:53,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bc35d0d/0ca6adfbf442461d913e3146e91e5b3b/FLAG7e470a1fa [2024-10-24 05:31:53,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23bc35d0d/0ca6adfbf442461d913e3146e91e5b3b [2024-10-24 05:31:53,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:31:53,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:31:53,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:53,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:31:53,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:31:53,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d454e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53, skipping insertion in model container [2024-10-24 05:31:53,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:31:53,635 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_steplocals_file-42.i[917,930] [2024-10-24 05:31:53,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:53,707 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:31:53,718 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_steplocals_file-42.i[917,930] [2024-10-24 05:31:53,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:31:53,763 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:31:53,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53 WrapperNode [2024-10-24 05:31:53,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:31:53,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:53,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:31:53,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:31:53,770 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:31:53" (1/1) ... [2024-10-24 05:31:53,778 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:31:53" (1/1) ... [2024-10-24 05:31:53,813 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-24 05:31:53,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:31:53,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:31:53,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:31:53,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:31:53,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,858 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:31:53,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:31:53,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:31:53,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:31:53,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:31:53,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (1/1) ... [2024-10-24 05:31:53,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:53,919 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:31:53,922 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:31:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:31:53,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:31:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:31:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:31:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:31:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:31:54,066 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:31:54,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:31:54,428 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 05:31:54,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:31:54,489 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:31:54,489 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:31:54,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:54 BoogieIcfgContainer [2024-10-24 05:31:54,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:31:54,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:31:54,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:31:54,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:31:54,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:31:53" (1/3) ... [2024-10-24 05:31:54,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b82825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:54, skipping insertion in model container [2024-10-24 05:31:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:31:53" (2/3) ... [2024-10-24 05:31:54,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b82825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:31:54, skipping insertion in model container [2024-10-24 05:31:54,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:54" (3/3) ... [2024-10-24 05:31:54,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2024-10-24 05:31:54,518 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:31:54,518 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:31:54,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:31:54,586 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;@5d0eaa2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:31:54,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:31:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:31:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 05:31:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:54,606 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:54,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1866911147, now seen corresponding path program 1 times [2024-10-24 05:31:54,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:54,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519993372] [2024-10-24 05:31:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:31:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:31:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:31:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:31:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:31:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:31:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:31:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:31:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:31:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:31:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:31:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:31:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:31:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:31:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:31:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:31:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:31:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:31:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:31:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:31:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:31:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:31:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:31:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 05:31:55,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:31:55,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519993372] [2024-10-24 05:31:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519993372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:31:55,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:31:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:31:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680430411] [2024-10-24 05:31:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:31:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:31:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:31:55,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:31:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:31:55,121 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 05:31:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:55,165 INFO L93 Difference]: Finished difference Result 125 states and 221 transitions. [2024-10-24 05:31:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:31:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-10-24 05:31:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:55,177 INFO L225 Difference]: With dead ends: 125 [2024-10-24 05:31:55,177 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 05:31:55,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:31:55,187 INFO L432 NwaCegarLoop]: 92 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, 92 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:31:55,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:31:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 05:31:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-24 05:31:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:31:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-10-24 05:31:55,232 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 144 [2024-10-24 05:31:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:55,232 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-10-24 05:31:55,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 05:31:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-10-24 05:31:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 05:31:55,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:55,237 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:31:55,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:55,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1206903383, now seen corresponding path program 1 times [2024-10-24 05:31:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:55,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438315302] [2024-10-24 05:31:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:31:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:31:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:31:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:31:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:31:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:31:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:31:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:31:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:31:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:31:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:31:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:31:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:31:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:31:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:31:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:31:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:31:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:31:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:31:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:31:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:31:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 05:31:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 05:31:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:31:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 05:31:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:31:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438315302] [2024-10-24 05:31:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438315302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:31:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:31:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:31:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019869955] [2024-10-24 05:31:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:31:55,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:31:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:31:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:31:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:31:55,903 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 05:31:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:31:55,975 INFO L93 Difference]: Finished difference Result 141 states and 215 transitions. [2024-10-24 05:31:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:31:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2024-10-24 05:31:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:31:55,981 INFO L225 Difference]: With dead ends: 141 [2024-10-24 05:31:55,981 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 05:31:55,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:31:55,991 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:31:55,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:31:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 05:31:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-10-24 05:31:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:31:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-10-24 05:31:56,016 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 144 [2024-10-24 05:31:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:31:56,020 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-10-24 05:31:56,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 05:31:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-10-24 05:31:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 05:31:56,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:31:56,023 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:31:56,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:31:56,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:31:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1828268523, now seen corresponding path program 1 times [2024-10-24 05:31:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:31:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437627326] [2024-10-24 05:31:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:31:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:31:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577165707] [2024-10-24 05:31:56,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:31:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:31:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:31:56,231 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:31:56,233 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:31:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:31:56,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:31:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:31:56,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:31:56,687 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:31:56,688 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:31:56,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:31:56,890 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:31:56,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:31:57,014 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:31:57,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:31:57 BoogieIcfgContainer [2024-10-24 05:31:57,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:31:57,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:31:57,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:31:57,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:31:57,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:31:54" (3/4) ... [2024-10-24 05:31:57,023 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:31:57,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:31:57,025 INFO L158 Benchmark]: Toolchain (without parser) took 3622.46ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 103.6MB in the beginning and 178.8MB in the end (delta: -75.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:57,025 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:57,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.07ms. Allocated memory is still 172.0MB. Free memory was 103.4MB in the beginning and 135.2MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 05:31:57,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.75ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 131.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:31:57,030 INFO L158 Benchmark]: Boogie Preprocessor took 68.48ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 127.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:31:57,031 INFO L158 Benchmark]: RCFGBuilder took 605.16ms. Allocated memory is still 172.0MB. Free memory was 127.2MB in the beginning and 101.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 05:31:57,031 INFO L158 Benchmark]: TraceAbstraction took 2527.29ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 101.0MB in the beginning and 178.8MB in the end (delta: -77.8MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-10-24 05:31:57,031 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 218.1MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:31:57,033 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.15ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.07ms. Allocated memory is still 172.0MB. Free memory was 103.4MB in the beginning and 135.2MB in the end (delta: -31.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.75ms. Allocated memory is still 172.0MB. Free memory was 135.2MB in the beginning and 131.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.48ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 127.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 605.16ms. Allocated memory is still 172.0MB. Free memory was 127.2MB in the beginning and 101.8MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2527.29ms. Allocated memory was 172.0MB in the beginning and 218.1MB in the end (delta: 46.1MB). Free memory was 101.0MB in the beginning and 178.8MB in the end (delta: -77.8MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 218.1MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = -200; [L25] signed short int var_1_4 = 2; [L26] signed char var_1_5 = -8; [L27] unsigned char var_1_6 = 10; [L28] unsigned char var_1_7 = 128; [L29] unsigned char var_1_8 = 1; [L30] float var_1_9 = 9999999999.5; [L31] unsigned char var_1_10 = 1; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 0; [L34] signed short int var_1_13 = 200; [L35] float var_1_14 = -0.8; [L36] float var_1_15 = 127.25; [L37] float var_1_16 = 3.5; [L38] unsigned short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 0; [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] var_1_3 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_3 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L102] RET assume_abort_if_not(var_1_3 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L103] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L103] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L104] var_1_4 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L105] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L106] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L106] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L107] var_1_5 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L108] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L109] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L109] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L110] var_1_7 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L111] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L112] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L112] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1, var_1_9=19999999999/2] [L113] var_1_9 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L114] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L117] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L119] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L120] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L121] var_1_12 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L122] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L123] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L123] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L125] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L127] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L128] var_1_18 = __VERIFIER_nondet_ushort() [L129] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L130] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L131] var_1_20 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L132] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L133] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L146] RET updateVariables() [L147] CALL step() [L45] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-32767, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=-32767, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=10, var_1_7=-285, var_1_8=1] [L53] COND TRUE var_1_5 >= -2 [L54] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, stepLocal_0=-32767, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=1] [L56] unsigned char stepLocal_2 = 49.5f <= var_1_9; [L57] signed short int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_2=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=1] [L58] COND FALSE !(stepLocal_2 && (var_1_2 && var_1_10)) [L65] var_1_8 = var_1_12 VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L67] unsigned char stepLocal_4 = var_1_6; [L68] signed long int stepLocal_3 = (((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)); VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, stepLocal_4=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L69] COND FALSE !(stepLocal_4 >= (var_1_1 / var_1_7)) [L76] var_1_13 = var_1_3 VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L78] unsigned char stepLocal_6 = var_1_2; [L79] signed short int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, stepLocal_5=-32767, stepLocal_6=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L80] COND TRUE (((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || stepLocal_6 VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, stepLocal_5=-32767, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L81] COND TRUE stepLocal_5 <= var_1_3 [L82] var_1_14 = (var_1_15 + var_1_16) VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L89] signed short int stepLocal_7 = var_1_3; VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, stepLocal_7=-32767, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L90] COND TRUE var_1_4 > stepLocal_7 [L91] var_1_17 = ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))) VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=127, var_1_18=0, var_1_19=1, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L93] COND TRUE var_1_9 <= var_1_15 [L94] var_1_19 = (var_1_12 || var_1_20) VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=29056, stepLocal_3=127, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=127, var_1_18=0, var_1_19=0, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L147] RET step() [L148] CALL, EXPR property() [L138-L139] return ((((((var_1_2 ? (var_1_1 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_3) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_9) && (var_1_2 && var_1_10)) ? ((var_1_1 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_2 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((var_1_6 >= (var_1_1 / var_1_7)) ? ((var_1_1 != ((((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) var_1_6))) : (var_1_13 == ((signed short int) var_1_3)))) && (((((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2) ? ((var_1_13 <= var_1_3) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_4 > var_1_3) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))))) : 1)) && ((var_1_9 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=127, var_1_18=0, var_1_19=0, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=127, var_1_18=0, var_1_19=0, var_1_1=29056, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=29056, var_1_5=127, var_1_6=127, var_1_7=-285, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 179 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 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:31:57,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_steplocals_file-42.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 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:31:59,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:31:59,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:31:59,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:31:59,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:31:59,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:31:59,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:31:59,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:31:59,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:31:59,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:31:59,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:31:59,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:31:59,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:31:59,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:31:59,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:31:59,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:31:59,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:31:59,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:31:59,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:31:59,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:31:59,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:31:59,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:31:59,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:31:59,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:31:59,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:31:59,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:31:59,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:31:59,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:31:59,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:31:59,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:31:59,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:31:59,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:31:59,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:31:59,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:31:59,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:31:59,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:31:59,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:31:59,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:31:59,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:31:59,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:31:59,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:31:59,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:31:59,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:31:59,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:31:59,451 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:31:59,451 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 -> 8f23a76680a88b4e3582239a1d89eab7ec3ee1b0bc583f7f275d3fe6394371a3 [2024-10-24 05:31:59,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:31:59,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:31:59,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:31:59,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:31:59,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:31:59,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-10-24 05:32:01,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:32:01,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:32:01,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-10-24 05:32:01,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dddb59436/1b6a38de015a44518f3a7b90b516aaa2/FLAG109f9f41f [2024-10-24 05:32:01,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dddb59436/1b6a38de015a44518f3a7b90b516aaa2 [2024-10-24 05:32:01,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:32:01,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:32:01,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:32:01,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:32:01,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:32:01,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:32:01" (1/1) ... [2024-10-24 05:32:01,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a889fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:01, skipping insertion in model container [2024-10-24 05:32:01,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:32:01" (1/1) ... [2024-10-24 05:32:01,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:32:02,135 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_steplocals_file-42.i[917,930] [2024-10-24 05:32:02,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:32:02,228 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:32:02,241 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_steplocals_file-42.i[917,930] [2024-10-24 05:32:02,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:32:02,328 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:32:02,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02 WrapperNode [2024-10-24 05:32:02,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:32:02,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:32:02,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:32:02,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:32:02,337 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:32:02" (1/1) ... [2024-10-24 05:32:02,355 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:32:02" (1/1) ... [2024-10-24 05:32:02,386 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-24 05:32:02,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:32:02,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:32:02,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:32:02,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:32:02,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,428 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:32:02,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:32:02,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:32:02,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:32:02,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:32:02,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (1/1) ... [2024-10-24 05:32:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:32:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:32:02,499 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:32:02,502 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:32:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:32:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:32:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:32:02,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:32:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:32:02,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:32:02,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:32:02,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:32:03,096 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 05:32:03,097 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:32:03,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:32:03,155 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:32:03,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:32:03 BoogieIcfgContainer [2024-10-24 05:32:03,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:32:03,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:32:03,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:32:03,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:32:03,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:32:01" (1/3) ... [2024-10-24 05:32:03,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61444ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:32:03, skipping insertion in model container [2024-10-24 05:32:03,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:32:02" (2/3) ... [2024-10-24 05:32:03,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61444ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:32:03, skipping insertion in model container [2024-10-24 05:32:03,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:32:03" (3/3) ... [2024-10-24 05:32:03,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2024-10-24 05:32:03,185 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:32:03,185 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:32:03,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:32:03,261 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;@67177695, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:32:03,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:32:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:32:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 05:32:03,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:32:03,283 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:03,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:32:03,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:32:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1866911147, now seen corresponding path program 1 times [2024-10-24 05:32:03,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:32:03,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235431017] [2024-10-24 05:32:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:32:03,306 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:32:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:32:03,310 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:32:03,311 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:32:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:32:03,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:32:03,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:32:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-24 05:32:03,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:32:03,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:32:03,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235431017] [2024-10-24 05:32:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235431017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:32:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:32:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:32:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167571728] [2024-10-24 05:32:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:32:03,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:32:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:32:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:32:03,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:32:03,684 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 05:32:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:32:03,772 INFO L93 Difference]: Finished difference Result 125 states and 221 transitions. [2024-10-24 05:32:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:32:03,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-10-24 05:32:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:32:03,784 INFO L225 Difference]: With dead ends: 125 [2024-10-24 05:32:03,784 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 05:32:03,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:32:03,792 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:32:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:32:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 05:32:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-24 05:32:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:32:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-10-24 05:32:03,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 144 [2024-10-24 05:32:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:32:03,833 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-10-24 05:32:03,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 05:32:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-10-24 05:32:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 05:32:03,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:32:03,837 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:03,844 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:32:04,038 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:32:04,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:32:04,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:32:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1206903383, now seen corresponding path program 1 times [2024-10-24 05:32:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:32:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901734072] [2024-10-24 05:32:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:32:04,041 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:32:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:32:04,044 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:32:04,045 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:32:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:32:04,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:32:04,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:32:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-10-24 05:32:04,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:32:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 05:32:04,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:32:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901734072] [2024-10-24 05:32:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901734072] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 05:32:04,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 05:32:04,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 05:32:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801049623] [2024-10-24 05:32:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:32:04,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:32:04,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:32:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:32:04,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:32:04,826 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 05:32:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:32:05,045 INFO L93 Difference]: Finished difference Result 141 states and 215 transitions. [2024-10-24 05:32:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:32:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2024-10-24 05:32:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:32:05,048 INFO L225 Difference]: With dead ends: 141 [2024-10-24 05:32:05,049 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 05:32:05,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:32:05,051 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 21 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:32:05,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 255 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:32:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 05:32:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-10-24 05:32:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 05:32:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-10-24 05:32:05,065 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 144 [2024-10-24 05:32:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:32:05,066 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-10-24 05:32:05,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 05:32:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-10-24 05:32:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 05:32:05,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:32:05,069 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:05,078 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:32:05,269 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:32:05,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:32:05,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:32:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1828268523, now seen corresponding path program 1 times [2024-10-24 05:32:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:32:05,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583970926] [2024-10-24 05:32:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:32:05,273 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:32:05,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:32:05,276 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:32:05,277 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:32:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:32:05,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 05:32:05,510 INFO L278 TraceCheckSpWp]: Computing forward predicates...