./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-41.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-41.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 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:32:19,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:32:19,111 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:32:19,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:32:19,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:32:19,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:32:19,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:32:19,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:32:19,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:32:19,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:32:19,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:32:19,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:32:19,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:32:19,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:32:19,132 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:32:19,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:32:19,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:32:19,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:32:19,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:32:19,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:32:19,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:32:19,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:32:19,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:32:19,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:32:19,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:32:19,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:32:19,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:32:19,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:32:19,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:32:19,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:32:19,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:32:19,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:32:19,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:32:19,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:32:19,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:32:19,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:32:19,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:32:19,144 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 -> 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 [2024-10-11 07:32:19,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:32:19,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:32:19,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:32:19,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:32:19,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:32:19,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:20,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:32:20,922 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:32:20,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:20,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab50aba71/293f68177f8c44d491f96a5749fbe824/FLAGe3506820f [2024-10-11 07:32:21,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ab50aba71/293f68177f8c44d491f96a5749fbe824 [2024-10-11 07:32:21,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:32:21,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:32:21,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:32:21,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:32:21,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:32:21,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e69221a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21, skipping insertion in model container [2024-10-11 07:32:21,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:32:21,481 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-41.i[917,930] [2024-10-11 07:32:21,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:32:21,529 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:32:21,541 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-41.i[917,930] [2024-10-11 07:32:21,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:32:21,590 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:32:21,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21 WrapperNode [2024-10-11 07:32:21,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:32:21,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:32:21,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:32:21,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:32:21,596 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:32:21" (1/1) ... [2024-10-11 07:32:21,603 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:32:21" (1/1) ... [2024-10-11 07:32:21,641 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-11 07:32:21,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:32:21,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:32:21,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:32:21,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:32:21,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,718 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:32:21,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:32:21,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:32:21,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:32:21,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:32:21,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (1/1) ... [2024-10-11 07:32:21,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:32:21,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:32:21,818 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:32:21,828 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:32:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:32:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:32:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:32:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:32:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:32:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:32:21,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:32:21,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:32:22,209 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:32:22,209 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:32:22,265 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:32:22,265 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:32:22,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:32:22 BoogieIcfgContainer [2024-10-11 07:32:22,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:32:22,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:32:22,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:32:22,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:32:22,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:32:21" (1/3) ... [2024-10-11 07:32:22,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ada27bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:32:22, skipping insertion in model container [2024-10-11 07:32:22,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:21" (2/3) ... [2024-10-11 07:32:22,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ada27bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:32:22, skipping insertion in model container [2024-10-11 07:32:22,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:32:22" (3/3) ... [2024-10-11 07:32:22,272 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:22,284 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:32:22,285 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:32:22,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:32:22,335 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;@246f53b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:32:22,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:32:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:32:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:22,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:22,356 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:22,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2138302208, now seen corresponding path program 1 times [2024-10-11 07:32:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:32:22,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002352557] [2024-10-11 07:32:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:32:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:32:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:32:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:32:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:32:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:32:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:32:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:32:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:32:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:32:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:32:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:32:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:32:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:32:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:32:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:32:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:32:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:32:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:32:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:32:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:32:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:32:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:32:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:32:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:32:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:32:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 07:32:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:32:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002352557] [2024-10-11 07:32:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002352557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:32:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:32:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:32:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173997374] [2024-10-11 07:32:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:32:22,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:32:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:32:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:32:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:32:22,736 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:32:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:32:22,763 INFO L93 Difference]: Finished difference Result 129 states and 229 transitions. [2024-10-11 07:32:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:32:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2024-10-11 07:32:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:32:22,771 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:32:22,771 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:32:22,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:32:22,776 INFO L432 NwaCegarLoop]: 95 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, 95 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:32:22,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:32:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:32:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:32:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:32:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2024-10-11 07:32:22,819 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 155 [2024-10-11 07:32:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:32:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2024-10-11 07:32:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:32:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2024-10-11 07:32:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:22,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:22,825 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:32:22,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash -611267266, now seen corresponding path program 1 times [2024-10-11 07:32:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:32:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502511829] [2024-10-11 07:32:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:32:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:32:23,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342686002] [2024-10-11 07:32:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:23,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:32:23,039 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:32:23,041 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:32:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:23,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 07:32:23,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:32:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-11 07:32:24,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:32:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:32:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502511829] [2024-10-11 07:32:26,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:32:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342686002] [2024-10-11 07:32:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342686002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:32:26,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:32:26,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-11 07:32:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011399624] [2024-10-11 07:32:26,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 07:32:26,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 07:32:26,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:32:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 07:32:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:32:26,183 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:32:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:32:26,871 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2024-10-11 07:32:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 07:32:26,872 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 155 [2024-10-11 07:32:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:32:26,874 INFO L225 Difference]: With dead ends: 200 [2024-10-11 07:32:26,874 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 07:32:26,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2024-10-11 07:32:26,876 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 86 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:32:26,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 469 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:32:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 07:32:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2024-10-11 07:32:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 07:32:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-10-11 07:32:26,892 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 155 [2024-10-11 07:32:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:32:26,893 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-10-11 07:32:26,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:32:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-10-11 07:32:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:26,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:26,895 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:26,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:32:27,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:27,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:27,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash -554008964, now seen corresponding path program 1 times [2024-10-11 07:32:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:32:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928624967] [2024-10-11 07:32:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:32:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:32:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:32:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:32:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:32:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:32:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:32:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:32:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:32:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:32:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:32:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:32:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:32:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:32:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:32:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:32:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:32:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:32:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:32:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:32:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:32:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:32:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:32:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:32:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:32:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:32:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 07:32:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:32:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928624967] [2024-10-11 07:32:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928624967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:32:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:32:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:32:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113007737] [2024-10-11 07:32:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:32:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:32:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:32:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:32:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:32:27,259 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 07:32:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:32:27,305 INFO L93 Difference]: Finished difference Result 257 states and 355 transitions. [2024-10-11 07:32:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:32:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2024-10-11 07:32:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:32:27,309 INFO L225 Difference]: With dead ends: 257 [2024-10-11 07:32:27,309 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 07:32:27,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:32:27,311 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:32:27,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:32:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 07:32:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-11 07:32:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.1785714285714286) internal successors, (99), 87 states have internal predecessors, (99), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:32:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2024-10-11 07:32:27,326 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 155 [2024-10-11 07:32:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:32:27,327 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2024-10-11 07:32:27,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 07:32:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2024-10-11 07:32:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:27,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:27,329 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:32:27,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1363355590, now seen corresponding path program 1 times [2024-10-11 07:32:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:32:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769054310] [2024-10-11 07:32:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:32:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:32:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883751614] [2024-10-11 07:32:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:32:27,392 INFO L229 MonitoredProcess]: Starting monitored process 3 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:32:27,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:32:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:27,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:32:27,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:32:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 510 proven. 36 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2024-10-11 07:32:27,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:32:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:32:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769054310] [2024-10-11 07:32:28,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:32:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883751614] [2024-10-11 07:32:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883751614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:32:28,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:32:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-10-11 07:32:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982338629] [2024-10-11 07:32:28,576 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 07:32:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:32:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:32:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:32:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:32:28,577 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 07:32:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:32:29,290 INFO L93 Difference]: Finished difference Result 318 states and 433 transitions. [2024-10-11 07:32:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 07:32:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 155 [2024-10-11 07:32:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:32:29,297 INFO L225 Difference]: With dead ends: 318 [2024-10-11 07:32:29,297 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 07:32:29,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-10-11 07:32:29,298 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 109 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:32:29,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 377 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:32:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 07:32:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 129. [2024-10-11 07:32:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 states have internal predecessors, (89), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 07:32:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2024-10-11 07:32:29,330 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 155 [2024-10-11 07:32:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:32:29,330 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2024-10-11 07:32:29,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 07:32:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2024-10-11 07:32:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 07:32:29,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:29,332 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:32:29,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:29,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1770174225, now seen corresponding path program 1 times [2024-10-11 07:32:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:32:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795964879] [2024-10-11 07:32:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:32:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:32:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359508139] [2024-10-11 07:32:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:29,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:29,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:32:29,596 INFO L229 MonitoredProcess]: Starting monitored process 4 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:32:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 07:32:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:32:30,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:32:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:32:30,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:32:30,355 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:32:30,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:32:30,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 07:32:30,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:32:30,561 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 07:32:30,643 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:32:30,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:32:30 BoogieIcfgContainer [2024-10-11 07:32:30,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:32:30,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:32:30,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:32:30,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:32:30,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:32:22" (3/4) ... [2024-10-11 07:32:30,648 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:32:30,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:32:30,651 INFO L158 Benchmark]: Toolchain (without parser) took 9327.55ms. Allocated memory was 186.6MB in the beginning and 308.3MB in the end (delta: 121.6MB). Free memory was 115.5MB in the beginning and 179.5MB in the end (delta: -64.1MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,652 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:32:30,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.58ms. Allocated memory is still 186.6MB. Free memory was 115.4MB in the beginning and 99.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.30ms. Allocated memory is still 186.6MB. Free memory was 99.9MB in the beginning and 96.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,652 INFO L158 Benchmark]: Boogie Preprocessor took 108.96ms. Allocated memory is still 186.6MB. Free memory was 96.0MB in the beginning and 151.1MB in the end (delta: -55.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,652 INFO L158 Benchmark]: RCFGBuilder took 514.07ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 123.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,653 INFO L158 Benchmark]: TraceAbstraction took 8378.62ms. Allocated memory was 186.6MB in the beginning and 308.3MB in the end (delta: 121.6MB). Free memory was 122.9MB in the beginning and 180.5MB in the end (delta: -57.7MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-10-11 07:32:30,655 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 308.3MB. Free memory was 180.5MB in the beginning and 179.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:32:30,656 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.58ms. Allocated memory is still 186.6MB. Free memory was 115.4MB in the beginning and 99.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.30ms. Allocated memory is still 186.6MB. Free memory was 99.9MB in the beginning and 96.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.96ms. Allocated memory is still 186.6MB. Free memory was 96.0MB in the beginning and 151.1MB in the end (delta: -55.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 514.07ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 123.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8378.62ms. Allocated memory was 186.6MB in the beginning and 308.3MB in the end (delta: 121.6MB). Free memory was 122.9MB in the beginning and 180.5MB in the end (delta: -57.7MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 308.3MB. Free memory was 180.5MB in the beginning and 179.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 100.25; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 4.8; [L29] signed char var_1_8 = 64; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 0; [L32] signed char var_1_11 = -10; [L33] signed char var_1_12 = 64; [L34] float var_1_13 = 1.6; [L35] float var_1_14 = 3.5; [L36] unsigned char var_1_15 = 8; [L37] unsigned char var_1_16 = 4; [L38] unsigned short int var_1_17 = 2; [L39] unsigned short int var_1_18 = 10000; [L40] unsigned short int var_1_19 = 5; [L41] signed short int var_1_20 = 4; [L42] unsigned long int var_1_21 = 5; [L43] signed char var_1_22 = -32; [L44] unsigned long int var_1_23 = 0; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_float() [L94] 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=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L94] 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=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L102] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L103] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L104] var_1_7 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L105] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L106] var_1_9 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] var_1_10 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] var_1_11 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] var_1_12 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] var_1_14 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] var_1_18 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] var_1_19 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] RET updateVariables() [L145] CALL step() [L48] COND TRUE (- var_1_2) > 31.9f [L49] var_1_1 = ((var_1_3 || var_1_4) && var_1_5) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L53] COND FALSE !((127.35 + var_1_2) <= var_1_7) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] unsigned short int stepLocal_0 = var_1_10; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND TRUE var_1_9 > stepLocal_0 [L60] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L62] unsigned char stepLocal_1 = var_1_12 < var_1_8; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L63] COND FALSE !((! var_1_5) || stepLocal_1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L70] COND TRUE \read(var_1_3) [L71] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L73] unsigned char stepLocal_2 = var_1_9 < var_1_15; VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L74] COND TRUE var_1_3 || stepLocal_2 [L75] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L79] signed long int stepLocal_3 = -10; VAL [isInitial=1, stepLocal_3=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L80] COND FALSE !(((var_1_17 / var_1_18) * var_1_19) < stepLocal_3) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L83] COND TRUE ! (var_1_21 <= var_1_10) [L84] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L89] var_1_22 = 1 [L90] var_1_23 = var_1_15 [L145] RET step() [L146] CALL, EXPR property() [L136-L137] return ((((((((((- var_1_2) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_3 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_2) <= var_1_7) ? ((4.5 <= (var_1_7 * var_1_2)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_9 > var_1_10) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < var_1_8)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_3 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_3 || (var_1_9 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_17 / var_1_18) * var_1_19) < -10) ? (var_1_20 == ((signed short int) ((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))))) : ((! (var_1_21 <= var_1_10)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_15)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=8192, var_1_18=204800, var_1_19=65536, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 5, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1324 IncrementalHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 396 mSDtfsCounter, 1324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=3, InterpolantAutomatonStates: 57, 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, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 2046 SizeOfPredicates, 9 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4731/4800 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:32:30,689 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-41.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 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:32:32,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:32:32,726 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:32:32,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:32:32,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:32:32,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:32:32,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:32:32,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:32:32,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:32:32,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:32:32,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:32:32,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:32:32,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:32:32,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:32:32,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:32:32,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:32:32,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:32:32,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:32:32,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:32:32,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:32:32,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:32:32,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:32:32,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:32:32,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:32:32,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:32:32,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:32:32,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:32:32,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:32:32,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:32:32,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:32:32,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:32:32,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:32:32,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:32:32,773 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:32:32,773 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:32:32,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:32:32,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:32:32,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:32:32,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:32:32,775 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:32:32,775 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 -> 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 [2024-10-11 07:32:33,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:32:33,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:32:33,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:32:33,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:32:33,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:32:33,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:34,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:32:34,769 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:32:34,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:34,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/232d21a30/7ad13ce9414146ddbabac468af847d48/FLAG18eb528d5 [2024-10-11 07:32:35,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/232d21a30/7ad13ce9414146ddbabac468af847d48 [2024-10-11 07:32:35,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:32:35,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:32:35,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:32:35,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:32:35,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:32:35,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153a3859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35, skipping insertion in model container [2024-10-11 07:32:35,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:32:35,323 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-41.i[917,930] [2024-10-11 07:32:35,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:32:35,405 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:32:35,416 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-41.i[917,930] [2024-10-11 07:32:35,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:32:35,464 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:32:35,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35 WrapperNode [2024-10-11 07:32:35,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:32:35,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:32:35,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:32:35,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:32:35,483 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:32:35" (1/1) ... [2024-10-11 07:32:35,493 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:32:35" (1/1) ... [2024-10-11 07:32:35,519 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-11 07:32:35,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:32:35,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:32:35,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:32:35,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:32:35,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,554 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:32:35,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:32:35,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:32:35,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:32:35,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:32:35,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (1/1) ... [2024-10-11 07:32:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:32:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:32:35,615 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:32:35,617 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:32:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:32:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:32:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:32:35,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:32:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:32:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:32:35,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:32:35,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:32:41,029 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:32:41,030 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:32:41,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:32:41,070 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:32:41,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:32:41 BoogieIcfgContainer [2024-10-11 07:32:41,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:32:41,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:32:41,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:32:41,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:32:41,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:32:35" (1/3) ... [2024-10-11 07:32:41,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571804e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:32:41, skipping insertion in model container [2024-10-11 07:32:41,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:32:35" (2/3) ... [2024-10-11 07:32:41,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571804e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:32:41, skipping insertion in model container [2024-10-11 07:32:41,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:32:41" (3/3) ... [2024-10-11 07:32:41,094 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-41.i [2024-10-11 07:32:41,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:32:41,106 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:32:41,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:32:41,172 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;@21f07d5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:32:41,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:32:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:32:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:41,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:41,189 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:41,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:41,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2138302208, now seen corresponding path program 1 times [2024-10-11 07:32:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:32:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88027401] [2024-10-11 07:32:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:41,207 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:32:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:32:41,213 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:32:41,221 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:32:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:41,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:32:41,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:32:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 07:32:41,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:32:41,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:32:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88027401] [2024-10-11 07:32:41,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88027401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:32:41,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:32:41,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:32:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189861775] [2024-10-11 07:32:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:32:41,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:32:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:32:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:32:41,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:32:41,642 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:32:45,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:32:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:32:45,802 INFO L93 Difference]: Finished difference Result 129 states and 229 transitions. [2024-10-11 07:32:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:32:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2024-10-11 07:32:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:32:45,854 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:32:45,854 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:32:45,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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:32:45,862 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:32:45,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 07:32:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:32:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:32:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:32:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2024-10-11 07:32:45,907 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 155 [2024-10-11 07:32:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:32:45,908 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2024-10-11 07:32:45,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:32:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2024-10-11 07:32:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 07:32:45,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:32:45,910 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,924 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:32:46,114 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:32:46,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:32:46,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:32:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash -611267266, now seen corresponding path program 1 times [2024-10-11 07:32:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:32:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240534608] [2024-10-11 07:32:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:46,117 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:32:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:32:46,120 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:32:46,123 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:32:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:46,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 07:32:46,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:32:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 24 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2024-10-11 07:32:48,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:32:50,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:32:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240534608] [2024-10-11 07:32:50,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240534608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:32:50,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294448702] [2024-10-11 07:32:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:32:50,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 07:32:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 07:32:50,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 07:32:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 07:32:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:32:51,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:32:51,638 INFO L278 TraceCheckSpWp]: Computing forward predicates...