./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 19:46:28,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:46:29,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:46:29,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:46:29,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:46:29,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:46:29,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:46:29,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:46:29,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:46:29,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:46:29,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:46:29,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:46:29,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:46:29,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:46:29,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:46:29,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:46:29,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:46:29,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:46:29,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:46:29,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:46:29,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:46:29,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:46:29,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:46:29,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:46:29,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:46:29,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:46:29,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:46:29,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:46:29,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:46:29,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:46:29,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:46:29,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:46:29,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:29,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:46:29,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:46:29,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:46:29,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:46:29,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:46:29,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:46:29,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:46:29,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:46:29,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:46:29,084 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-11-08 19:46:29,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:46:29,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:46:29,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:46:29,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:46:29,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:46:29,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:30,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:46:31,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:46:31,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:31,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5423cd3fc/9a02f9c870ca4f2d8075ada050adc3b0/FLAG8a302c501 [2024-11-08 19:46:31,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5423cd3fc/9a02f9c870ca4f2d8075ada050adc3b0 [2024-11-08 19:46:31,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:46:31,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:46:31,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:31,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:46:31,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:46:31,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604117f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31, skipping insertion in model container [2024-11-08 19:46:31,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:46:31,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i[917,930] [2024-11-08 19:46:31,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:31,357 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:46:31,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i[917,930] [2024-11-08 19:46:31,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:31,420 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:46:31,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31 WrapperNode [2024-11-08 19:46:31,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:31,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:31,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:46:31,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:46:31,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,488 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-08 19:46:31,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:31,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:46:31,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:46:31,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:46:31,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:46:31,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:46:31,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:46:31,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:46:31,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:46:31,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (1/1) ... [2024-11-08 19:46:31,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:46:31,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:46:31,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:46:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:46:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:46:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:46:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:46:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:46:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:46:31,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:46:31,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:46:32,090 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 19:46:32,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:46:32,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:46:32,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:46:32,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:46:32 BoogieIcfgContainer [2024-11-08 19:46:32,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:46:32,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:46:32,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:46:32,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:46:32,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:46:31" (1/3) ... [2024-11-08 19:46:32,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2cbb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:46:32, skipping insertion in model container [2024-11-08 19:46:32,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:31" (2/3) ... [2024-11-08 19:46:32,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2cbb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:46:32, skipping insertion in model container [2024-11-08 19:46:32,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:46:32" (3/3) ... [2024-11-08 19:46:32,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:32,126 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:46:32,126 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:46:32,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:46:32,191 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;@5170ae7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:46:32,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:46:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 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-11-08 19:46:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:46:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:32,207 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, 1, 1, 1] [2024-11-08 19:46:32,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:32,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1882836578, now seen corresponding path program 1 times [2024-11-08 19:46:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:46:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709347138] [2024-11-08 19:46:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:46:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:46:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:46:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:46:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:46:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:46:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:46:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:46:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:46:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:46:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:46:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:46:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:46:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:46:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:46:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:46:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:46:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:46:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:46:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:46:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:46:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:46:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:46:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:46:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 19:46:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:46:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709347138] [2024-11-08 19:46:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709347138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:46:32,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:46:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:46:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852481472] [2024-11-08 19:46:32,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:46:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:46:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:46:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:46:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:46:32,742 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 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), 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-11-08 19:46:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:46:32,776 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2024-11-08 19:46:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:46:32,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), 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 148 [2024-11-08 19:46:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:46:32,788 INFO L225 Difference]: With dead ends: 133 [2024-11-08 19:46:32,789 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 19:46:32,792 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-11-08 19:46:32,797 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:46:32,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:46:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 19:46:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 19:46:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-11-08 19:46:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2024-11-08 19:46:32,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 148 [2024-11-08 19:46:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:46:32,838 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2024-11-08 19:46:32,838 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), 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-11-08 19:46:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2024-11-08 19:46:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:46:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:32,842 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, 1, 1, 1] [2024-11-08 19:46:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:46:32,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1613160800, now seen corresponding path program 1 times [2024-11-08 19:46:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:46:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681119111] [2024-11-08 19:46:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:46:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:46:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:46:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:46:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:46:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:46:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:46:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:46:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:46:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:46:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:46:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:46:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:46:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:46:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:46:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:46:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:46:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:46:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:46:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:46:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:46:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:46:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:46:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:46:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 19:46:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:46:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681119111] [2024-11-08 19:46:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681119111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:46:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:46:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:46:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534066101] [2024-11-08 19:46:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:46:33,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:46:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:46:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:46:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:46:33,546 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 19:46:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:46:33,615 INFO L93 Difference]: Finished difference Result 149 states and 223 transitions. [2024-11-08 19:46:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:46:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 148 [2024-11-08 19:46:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:46:33,618 INFO L225 Difference]: With dead ends: 149 [2024-11-08 19:46:33,621 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 19:46:33,622 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-11-08 19:46:33,623 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:46:33,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:46:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 19:46:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-11-08 19:46:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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-11-08 19:46:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-11-08 19:46:33,643 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 148 [2024-11-08 19:46:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:46:33,646 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-11-08 19:46:33,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 19:46:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-11-08 19:46:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:46:33,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:33,650 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, 1, 1, 1, 1] [2024-11-08 19:46:33,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:46:33,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2109701824, now seen corresponding path program 1 times [2024-11-08 19:46:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:46:33,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171722797] [2024-11-08 19:46:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:46:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:46:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929398652] [2024-11-08 19:46:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:33,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:46:33,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:46:33,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:46:33,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:46:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:46:34,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:46:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:46:34,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:46:34,229 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:46:34,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:46:34,242 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-11-08 19:46:34,436 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-11-08 19:46:34,440 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:46:34,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:46:34,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:46:34 BoogieIcfgContainer [2024-11-08 19:46:34,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:46:34,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:46:34,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:46:34,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:46:34,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:46:32" (3/4) ... [2024-11-08 19:46:34,559 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:46:34,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:46:34,562 INFO L158 Benchmark]: Toolchain (without parser) took 3511.30ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.2MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,562 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:46:34,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.88ms. Allocated memory is still 153.1MB. Free memory was 100.2MB in the beginning and 84.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.65ms. Allocated memory is still 153.1MB. Free memory was 84.6MB in the beginning and 121.6MB in the end (delta: -37.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,565 INFO L158 Benchmark]: Boogie Preprocessor took 64.17ms. Allocated memory is still 153.1MB. Free memory was 121.6MB in the beginning and 117.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,566 INFO L158 Benchmark]: RCFGBuilder took 544.95ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 107.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,566 INFO L158 Benchmark]: TraceAbstraction took 2447.92ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 106.1MB in the beginning and 99.3MB in the end (delta: 6.7MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-08 19:46:34,566 INFO L158 Benchmark]: Witness Printer took 8.36ms. Allocated memory is still 186.6MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:46:34,568 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.17ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.88ms. Allocated memory is still 153.1MB. Free memory was 100.2MB in the beginning and 84.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.65ms. Allocated memory is still 153.1MB. Free memory was 84.6MB in the beginning and 121.6MB in the end (delta: -37.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.17ms. Allocated memory is still 153.1MB. Free memory was 121.6MB in the beginning and 117.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 544.95ms. Allocated memory is still 153.1MB. Free memory was 117.3MB in the beginning and 107.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2447.92ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 106.1MB in the beginning and 99.3MB in the end (delta: 6.7MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 8.36ms. Allocated memory is still 186.6MB. Free memory is still 98.3MB. 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; VAL [isInitial=0, 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=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] [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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L117] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L119] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L120] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L122] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L123] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L123] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L129] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-255, 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=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L130] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L130] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L132] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L133] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, var_1_8=1] [L133] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=10, var_1_7=383, 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=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_2=0, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, stepLocal_4=27, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, stepLocal_5=-32767, stepLocal_6=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, stepLocal_5=-32767, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L89] signed short int stepLocal_7 = var_1_3; VAL [isInitial=1, stepLocal_0=-32767, stepLocal_1=3556, stepLocal_3=127, stepLocal_7=-32767, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=255, var_1_18=228, var_1_19=1, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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=3556, stepLocal_3=127, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=255, var_1_18=228, var_1_19=0, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, 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) ; VAL [\result=0, isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=255, var_1_18=228, var_1_19=0, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=255, var_1_18=228, var_1_19=0, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=255, var_1_18=228, var_1_19=0, var_1_1=3556, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3556, var_1_5=127, var_1_6=27, var_1_7=383, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 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, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 194 mSDtfsCounter, 20 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=74occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 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-11-08 19:46:34,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-08 19:46:36,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:46:36,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:46:36,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:46:36,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:46:36,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:46:36,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:46:36,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:46:36,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:46:36,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:46:36,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:46:36,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:46:36,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:46:36,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:46:36,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:46:36,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:46:36,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:46:36,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:46:36,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:46:36,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:46:36,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:46:36,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:46:36,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:46:36,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:46:36,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:46:36,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:46:36,978 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:46:36,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:46:36,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:46:36,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:46:36,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:46:36,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:46:36,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:46:36,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:46:36,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:36,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:46:36,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:46:36,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:46:36,981 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:46:36,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:46:36,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:46:36,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:46:36,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:46:36,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:46:36,983 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-11-08 19:46:37,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:46:37,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:46:37,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:46:37,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:46:37,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:46:37,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:38,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:46:39,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:46:39,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:39,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b7484df/6484b07a9df542b3935d247ce5df62d5/FLAGf13231a6a [2024-11-08 19:46:39,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b7484df/6484b07a9df542b3935d247ce5df62d5 [2024-11-08 19:46:39,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:46:39,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:46:39,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:39,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:46:39,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:46:39,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70bebd87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39, skipping insertion in model container [2024-11-08 19:46:39,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:46:39,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i[917,930] [2024-11-08 19:46:39,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:39,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:46:39,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-42.i[917,930] [2024-11-08 19:46:39,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:46:39,455 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:46:39,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39 WrapperNode [2024-11-08 19:46:39,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:46:39,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:39,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:46:39,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:46:39,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,513 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-08 19:46:39,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:46:39,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:46:39,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:46:39,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:46:39,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,553 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:46:39,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:46:39,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:46:39,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:46:39,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:46:39,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (1/1) ... [2024-11-08 19:46:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:46:39,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:46:39,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:46:39,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:46:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:46:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:46:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:46:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:46:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:46:39,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:46:39,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:46:40,221 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 19:46:40,223 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:46:40,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:46:40,239 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:46:40,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:46:40 BoogieIcfgContainer [2024-11-08 19:46:40,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:46:40,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:46:40,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:46:40,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:46:40,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:46:39" (1/3) ... [2024-11-08 19:46:40,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e50b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:46:40, skipping insertion in model container [2024-11-08 19:46:40,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:46:39" (2/3) ... [2024-11-08 19:46:40,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e50b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:46:40, skipping insertion in model container [2024-11-08 19:46:40,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:46:40" (3/3) ... [2024-11-08 19:46:40,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-42.i [2024-11-08 19:46:40,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:46:40,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:46:40,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:46:40,360 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;@10df0521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:46:40,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:46:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 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-11-08 19:46:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:46:40,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:40,381 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, 1, 1, 1] [2024-11-08 19:46:40,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1882836578, now seen corresponding path program 1 times [2024-11-08 19:46:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:46:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766240332] [2024-11-08 19:46:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:46:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:46:40,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:46:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:46:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:40,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:46:40,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:46:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 19:46:40,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:46:40,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:46:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766240332] [2024-11-08 19:46:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766240332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:46:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:46:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:46:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568935052] [2024-11-08 19:46:40,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:46:40,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:46:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:46:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:46:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:46:40,751 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-11-08 19:46:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:46:40,786 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2024-11-08 19:46:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:46:40,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 148 [2024-11-08 19:46:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:46:40,796 INFO L225 Difference]: With dead ends: 133 [2024-11-08 19:46:40,797 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 19:46:40,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:46:40,804 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:46:40,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:46:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 19:46:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 19:46:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-11-08 19:46:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2024-11-08 19:46:40,849 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 148 [2024-11-08 19:46:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:46:40,850 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2024-11-08 19:46:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-11-08 19:46:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2024-11-08 19:46:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:46:40,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:40,857 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, 1, 1, 1] [2024-11-08 19:46:40,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:46:41,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:46:41,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1613160800, now seen corresponding path program 1 times [2024-11-08 19:46:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:46:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52361418] [2024-11-08 19:46:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:41,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:46:41,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:46:41,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:46:41,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:46:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:41,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:46:41,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:46:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2024-11-08 19:46:41,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:46:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 19:46:41,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:46:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52361418] [2024-11-08 19:46:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52361418] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:46:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:46:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-08 19:46:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979994316] [2024-11-08 19:46:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:46:41,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:46:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:46:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:46:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:46:41,850 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 19:46:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:46:41,977 INFO L93 Difference]: Finished difference Result 149 states and 223 transitions. [2024-11-08 19:46:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:46:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 148 [2024-11-08 19:46:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:46:41,982 INFO L225 Difference]: With dead ends: 149 [2024-11-08 19:46:41,984 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 19:46:41,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 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-11-08 19:46:41,995 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 23 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:46:41,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:46:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 19:46:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-11-08 19:46:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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-11-08 19:46:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-11-08 19:46:42,012 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 148 [2024-11-08 19:46:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:46:42,014 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-11-08 19:46:42,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 19:46:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-11-08 19:46:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:46:42,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:46:42,022 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, 1, 1, 1, 1] [2024-11-08 19:46:42,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:46:42,223 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-11-08 19:46:42,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:46:42,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:46:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2109701824, now seen corresponding path program 1 times [2024-11-08 19:46:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:46:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662204905] [2024-11-08 19:46:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:46:42,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:46:42,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:46:42,229 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-11-08 19:46:42,230 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-11-08 19:46:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:46:42,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 19:46:42,435 INFO L278 TraceCheckSpWp]: Computing forward predicates...