./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:36:40,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:36:40,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:36:40,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:36:40,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:36:40,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:36:40,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:36:40,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:36:40,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:36:40,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:36:40,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:36:40,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:36:40,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:36:40,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:36:40,340 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:36:40,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:36:40,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:36:40,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:36:40,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:36:40,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:36:40,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:36:40,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:36:40,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:36:40,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:36:40,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:36:40,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:36:40,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:36:40,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:36:40,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:36:40,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:36:40,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:36:40,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:36:40,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:36:40,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:36:40,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:36:40,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:36:40,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:36:40,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:36:40,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:36:40,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:36:40,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:36:40,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:36:40,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2024-10-11 07:36:40,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:36:40,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:36:40,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:36:40,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:36:40,648 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:36:40,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:42,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:36:42,329 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:36:42,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:42,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b125142a4/8991bad8b3f44f70a4c221fe931013d8/FLAGc575db703 [2024-10-11 07:36:42,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b125142a4/8991bad8b3f44f70a4c221fe931013d8 [2024-10-11 07:36:42,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:36:42,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:36:42,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:36:42,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:36:42,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:36:42,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:36:42" (1/1) ... [2024-10-11 07:36:42,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717bcf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:42, skipping insertion in model container [2024-10-11 07:36:42,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:36:42" (1/1) ... [2024-10-11 07:36:42,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:36:42,890 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-11 07:36:42,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:36:42,956 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:36:42,968 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-11 07:36:43,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:36:43,024 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:36:43,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43 WrapperNode [2024-10-11 07:36:43,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:36:43,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:36:43,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:36:43,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:36:43,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,072 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-11 07:36:43,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:36:43,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:36:43,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:36:43,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:36:43,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,113 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:36:43,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:36:43,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:36:43,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:36:43,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:36:43,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (1/1) ... [2024-10-11 07:36:43,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:36:43,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:36:43,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:36:43,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:36:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:36:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:36:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:36:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:36:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:36:43,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:36:43,315 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:36:43,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:36:43,639 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 07:36:43,640 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:36:43,693 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:36:43,693 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:36:43,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:36:43 BoogieIcfgContainer [2024-10-11 07:36:43,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:36:43,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:36:43,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:36:43,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:36:43,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:36:42" (1/3) ... [2024-10-11 07:36:43,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d621f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:36:43, skipping insertion in model container [2024-10-11 07:36:43,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:43" (2/3) ... [2024-10-11 07:36:43,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d621f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:36:43, skipping insertion in model container [2024-10-11 07:36:43,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:36:43" (3/3) ... [2024-10-11 07:36:43,707 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:43,725 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:36:43,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:36:43,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:36:43,805 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;@7ef5a454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:36:43,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:36:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:36:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:43,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:43,827 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] [2024-10-11 07:36:43,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -731401140, now seen corresponding path program 1 times [2024-10-11 07:36:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:36:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950372028] [2024-10-11 07:36:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:36:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:36:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:36:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:36:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:36:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:36:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:36:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:36:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:36:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:36:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:36:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:36:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:36:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:36:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:36:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:36:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:36:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:36:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:36:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:36:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:36:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:36:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:36:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:36:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 07:36:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:36:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950372028] [2024-10-11 07:36:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950372028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:36:44,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:36:44,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:36:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279853903] [2024-10-11 07:36:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:36:44,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:36:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:36:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:36:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:36:44,400 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:36:44,448 INFO L93 Difference]: Finished difference Result 121 states and 215 transitions. [2024-10-11 07:36:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:36:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 142 [2024-10-11 07:36:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:36:44,461 INFO L225 Difference]: With dead ends: 121 [2024-10-11 07:36:44,462 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 07:36:44,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:36:44,471 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:36:44,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:36:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 07:36:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 07:36:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:36:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-11 07:36:44,530 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2024-10-11 07:36:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:36:44,532 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-11 07:36:44,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-11 07:36:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:44,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:44,537 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] [2024-10-11 07:36:44,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:36:44,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:44,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1451628806, now seen corresponding path program 1 times [2024-10-11 07:36:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:36:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836838962] [2024-10-11 07:36:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:36:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:36:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:36:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:36:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:36:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:36:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:36:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:36:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:36:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:36:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:36:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:36:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:36:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:36:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:36:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:36:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:36:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:36:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:36:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:36:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:36:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:36:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:36:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:36:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 07:36:45,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:36:45,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836838962] [2024-10-11 07:36:45,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836838962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:36:45,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:36:45,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:36:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792026091] [2024-10-11 07:36:45,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:36:45,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:36:45,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:36:45,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:36:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:36:45,123 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:36:45,455 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2024-10-11 07:36:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:36:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 142 [2024-10-11 07:36:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:36:45,459 INFO L225 Difference]: With dead ends: 156 [2024-10-11 07:36:45,461 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 07:36:45,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:36:45,464 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 120 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:36:45,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:36:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 07:36:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-11 07:36:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.305084745762712) internal successors, (77), 60 states have internal predecessors, (77), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:36:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-10-11 07:36:45,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 142 [2024-10-11 07:36:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:36:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-10-11 07:36:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-10-11 07:36:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:45,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:45,501 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] [2024-10-11 07:36:45,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:36:45,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1451688388, now seen corresponding path program 1 times [2024-10-11 07:36:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:36:45,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758083130] [2024-10-11 07:36:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:36:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:36:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133164958] [2024-10-11 07:36:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:45,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:36:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:36:45,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:36:45,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:36:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:36:45,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:36:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:36:45,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:36:45,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:36:45,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:36:45,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:36:46,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:36:46,115 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:36:46,207 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:36:46,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:36:46 BoogieIcfgContainer [2024-10-11 07:36:46,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:36:46,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:36:46,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:36:46,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:36:46,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:36:43" (3/4) ... [2024-10-11 07:36:46,218 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:36:46,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:36:46,221 INFO L158 Benchmark]: Toolchain (without parser) took 3520.58ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 94.3MB in the end (delta: 32.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-10-11 07:36:46,221 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:36:46,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.21ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 111.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:36:46,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.59ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 108.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:36:46,222 INFO L158 Benchmark]: Boogie Preprocessor took 67.54ms. Allocated memory is still 180.4MB. Free memory was 108.2MB in the beginning and 103.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:36:46,223 INFO L158 Benchmark]: RCFGBuilder took 551.67ms. Allocated memory is still 180.4MB. Free memory was 103.3MB in the beginning and 79.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 07:36:46,223 INFO L158 Benchmark]: TraceAbstraction took 2515.75ms. Allocated memory is still 180.4MB. Free memory was 78.8MB in the beginning and 94.3MB in the end (delta: -15.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:36:46,223 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 180.4MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:36:46,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.21ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 111.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.59ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 108.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.54ms. Allocated memory is still 180.4MB. Free memory was 108.2MB in the beginning and 103.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.67ms. Allocated memory is still 180.4MB. Free memory was 103.3MB in the beginning and 79.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2515.75ms. Allocated memory is still 180.4MB. Free memory was 78.8MB in the beginning and 94.3MB in the end (delta: -15.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 180.4MB. Free memory is still 94.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 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] signed long int var_1_5 = -16; [L27] float var_1_6 = 255.25; [L28] unsigned short int var_1_7 = 16; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = -8; [L31] unsigned short int var_1_10 = 8; [L32] unsigned short int var_1_11 = 10000; [L33] unsigned short int var_1_12 = 5; [L34] signed short int var_1_13 = 200; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned short int var_1_16 = 35895; [L38] unsigned short int var_1_17 = 18336; [L39] unsigned char var_1_18 = 0; [L40] signed long int var_1_19 = -50; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L93] var_1_3 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] var_1_4 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L96] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L101] var_1_6 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L102] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L103] var_1_7 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L105] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L105] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L106] var_1_9 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L107] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L108] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L108] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L110] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L111] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L111] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L112] var_1_12 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L114] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L114] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L115] var_1_14 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L116] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L117] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L117] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L120] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L120] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L121] var_1_17 = __VERIFIER_nondet_ushort() [L122] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L122] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L123] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L123] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L126] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L126] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L139] RET updateVariables() [L140] CALL step() [L44] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, stepLocal_0=2, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L45] COND FALSE !(stepLocal_0 <= var_1_5) [L52] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-127] [L54] COND TRUE (- var_1_7) < (var_1_5 * var_1_4) [L55] var_1_8 = var_1_9 VAL [isInitial=1, var_1_10=8, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L57] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L58] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L65] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, stepLocal_1=16640, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L66] COND FALSE !(var_1_3 != var_1_6) [L73] var_1_15 = var_1_18 VAL [isInitial=1, stepLocal_1=16640, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L75] signed long int stepLocal_4 = - var_1_5; [L76] signed long int stepLocal_3 = var_1_7 + (128 + var_1_10); [L77] signed long int stepLocal_2 = ((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11; VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=18369, stepLocal_4=8191, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L78] COND TRUE var_1_10 < stepLocal_4 VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=18369, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L79] COND FALSE !(stepLocal_3 <= var_1_8) VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= var_1_5) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_5 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (var_1_14 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_1 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_10 < (- var_1_5)) ? (((var_1_7 + (128 + var_1_10)) <= var_1_8) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_10 < (((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, var_1_10=1858, var_1_11=73727, var_1_12=16383, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-127, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 168 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:36:46,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:36:48,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:36:48,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:36:48,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:36:48,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:36:48,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:36:48,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:36:48,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:36:48,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:36:48,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:36:48,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:36:48,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:36:48,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:36:48,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:36:48,649 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:36:48,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:36:48,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:36:48,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:36:48,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:36:48,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:36:48,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:36:48,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:36:48,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:36:48,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:36:48,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:36:48,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:36:48,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:36:48,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:36:48,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:36:48,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:36:48,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:36:48,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:36:48,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:36:48,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:36:48,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:36:48,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:36:48,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:36:48,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:36:48,660 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:36:48,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:36:48,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:36:48,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:36:48,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:36:48,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:36:48,661 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:36:48,662 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2024-10-11 07:36:48,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:36:48,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:36:48,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:36:48,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:36:48,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:36:48,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:50,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:36:50,822 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:36:50,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:50,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/13af96ae6/6146bb40411840b886257ee6b6a81226/FLAGe90066147 [2024-10-11 07:36:50,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/13af96ae6/6146bb40411840b886257ee6b6a81226 [2024-10-11 07:36:50,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:36:50,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:36:50,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:36:50,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:36:50,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:36:50,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:36:50" (1/1) ... [2024-10-11 07:36:50,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7e4c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:50, skipping insertion in model container [2024-10-11 07:36:50,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:36:50" (1/1) ... [2024-10-11 07:36:50,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:36:51,088 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-11 07:36:51,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:36:51,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:36:51,196 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i[917,930] [2024-10-11 07:36:51,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:36:51,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:36:51,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51 WrapperNode [2024-10-11 07:36:51,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:36:51,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:36:51,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:36:51,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:36:51,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,333 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-11 07:36:51,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:36:51,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:36:51,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:36:51,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:36:51,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,377 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:36:51,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:36:51,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:36:51,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:36:51,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:36:51,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (1/1) ... [2024-10-11 07:36:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:36:51,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:36:51,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:36:51,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:36:51,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:36:51,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:36:51,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:36:51,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:36:51,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:36:51,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:36:51,577 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:36:51,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:36:52,709 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 07:36:52,709 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:36:52,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:36:52,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:36:52,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:36:52 BoogieIcfgContainer [2024-10-11 07:36:52,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:36:52,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:36:52,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:36:52,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:36:52,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:36:50" (1/3) ... [2024-10-11 07:36:52,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655f4b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:36:52, skipping insertion in model container [2024-10-11 07:36:52,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:36:51" (2/3) ... [2024-10-11 07:36:52,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655f4b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:36:52, skipping insertion in model container [2024-10-11 07:36:52,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:36:52" (3/3) ... [2024-10-11 07:36:52,800 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2024-10-11 07:36:52,816 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:36:52,816 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:36:52,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:36:52,896 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;@1f293541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:36:52,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:36:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:36:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:52,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:52,917 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] [2024-10-11 07:36:52,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -731401140, now seen corresponding path program 1 times [2024-10-11 07:36:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:36:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164733101] [2024-10-11 07:36:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:36:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:36:52,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:36:52,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:36:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:53,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:36:53,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:36:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-11 07:36:53,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:36:53,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:36:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164733101] [2024-10-11 07:36:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164733101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:36:53,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:36:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:36:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446181060] [2024-10-11 07:36:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:36:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:36:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:36:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:36:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:36:53,338 INFO L87 Difference]: Start difference. First operand has 62 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:36:53,829 INFO L93 Difference]: Finished difference Result 121 states and 215 transitions. [2024-10-11 07:36:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:36:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 142 [2024-10-11 07:36:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:36:53,851 INFO L225 Difference]: With dead ends: 121 [2024-10-11 07:36:53,852 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 07:36:53,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:36:53,858 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:36:53,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:36:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 07:36:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 07:36:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:36:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-11 07:36:53,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 142 [2024-10-11 07:36:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:36:53,903 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-11 07:36:53,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 07:36:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-11 07:36:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:53,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:53,908 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] [2024-10-11 07:36:53,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:36:54,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:36:54,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:54,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1451628806, now seen corresponding path program 1 times [2024-10-11 07:36:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:36:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528067882] [2024-10-11 07:36:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:54,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:36:54,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:36:54,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:36:54,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:36:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:54,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 07:36:54,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:36:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 78 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-11 07:36:55,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:36:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 07:36:56,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:36:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528067882] [2024-10-11 07:36:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528067882] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 07:36:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:36:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-10-11 07:36:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125181490] [2024-10-11 07:36:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:36:56,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:36:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:36:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:36:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:36:56,045 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:36:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:36:56,373 INFO L93 Difference]: Finished difference Result 120 states and 184 transitions. [2024-10-11 07:36:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:36:56,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 142 [2024-10-11 07:36:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:36:56,385 INFO L225 Difference]: With dead ends: 120 [2024-10-11 07:36:56,386 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 07:36:56,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:36:56,388 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:36:56,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 168 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:36:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 07:36:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-11 07:36:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:36:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2024-10-11 07:36:56,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 142 [2024-10-11 07:36:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:36:56,401 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2024-10-11 07:36:56,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:36:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2024-10-11 07:36:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 07:36:56,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:36:56,403 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] [2024-10-11 07:36:56,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:36:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:36:56,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:36:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:36:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1451688388, now seen corresponding path program 1 times [2024-10-11 07:36:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:36:56,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356359244] [2024-10-11 07:36:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:36:56,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:36:56,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:36:56,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:36:56,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:36:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:36:56,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 07:36:56,895 INFO L278 TraceCheckSpWp]: Computing forward predicates...