./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_operatoramount_amount100_file-91.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_operatoramount_amount100_file-91.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 ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:16:47,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:16:47,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:16:47,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:16:47,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:16:47,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:16:47,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:16:47,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:16:47,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:16:47,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:16:47,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:16:47,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:16:47,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:16:47,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:16:47,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:16:47,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:16:47,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:16:47,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:16:47,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:16:47,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:16:47,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:16:47,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:16:47,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:16:47,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:16:47,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:16:47,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:16:47,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:16:47,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:16:47,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:16:47,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:16:47,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:16:47,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:16:47,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:47,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:16:47,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:16:47,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:16:47,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:16:47,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:16:47,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:16:47,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:16:47,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:16:47,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:16:47,605 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 -> ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 [2024-10-11 12:16:47,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:16:47,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:16:47,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:16:47,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:16:47,855 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:16:47,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-10-11 12:16:49,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:16:49,322 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:16:49,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-10-11 12:16:49,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a7804487/09ddaf706b0744c18a893a2c9e4081cd/FLAG400265b65 [2024-10-11 12:16:49,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6a7804487/09ddaf706b0744c18a893a2c9e4081cd [2024-10-11 12:16:49,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:16:49,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:16:49,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:49,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:16:49,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:16:49,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce97270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49, skipping insertion in model container [2024-10-11 12:16:49,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:16:49,531 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_operatoramount_amount100_file-91.i[916,929] [2024-10-11 12:16:49,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:49,679 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:16:49,688 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_operatoramount_amount100_file-91.i[916,929] [2024-10-11 12:16:49,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:16:49,761 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:16:49,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49 WrapperNode [2024-10-11 12:16:49,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:16:49,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:49,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:16:49,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:16:49,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,825 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-11 12:16:49,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:16:49,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:16:49,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:16:49,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:16:49,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,884 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 12:16:49,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:16:49,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:16:49,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:16:49,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:16:49,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (1/1) ... [2024-10-11 12:16:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:16:49,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:49,960 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 12:16:49,967 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 12:16:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:16:50,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:16:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:16:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:16:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:16:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:16:50,091 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:16:50,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:16:50,556 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 12:16:50,556 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:16:50,608 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:16:50,608 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:16:50,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:50 BoogieIcfgContainer [2024-10-11 12:16:50,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:16:50,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:16:50,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:16:50,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:16:50,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:16:49" (1/3) ... [2024-10-11 12:16:50,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:50, skipping insertion in model container [2024-10-11 12:16:50,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:16:49" (2/3) ... [2024-10-11 12:16:50,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:16:50, skipping insertion in model container [2024-10-11 12:16:50,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:50" (3/3) ... [2024-10-11 12:16:50,618 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-91.i [2024-10-11 12:16:50,633 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:16:50,633 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:16:50,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:16:50,700 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;@6901cbd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:16:50,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:16:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 12:16:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 12:16:50,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:50,716 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, 1, 1, 1, 1, 1] [2024-10-11 12:16:50,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:50,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1265559604, now seen corresponding path program 1 times [2024-10-11 12:16:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716165032] [2024-10-11 12:16:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:16:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:16:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:16:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:16:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:16:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:16:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:16:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:16:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:16:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 12:16:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:16:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 12:16:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:16:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:16:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 12:16:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 12:16:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 12:16:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:51,226 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 12:16:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716165032] [2024-10-11 12:16:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716165032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:16:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:16:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:16:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264098516] [2024-10-11 12:16:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:16:51,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:16:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:16:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:16:51,255 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 12:16:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:51,322 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2024-10-11 12:16:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:16:51,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 161 [2024-10-11 12:16:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:51,349 INFO L225 Difference]: With dead ends: 147 [2024-10-11 12:16:51,349 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 12:16:51,357 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 12:16:51,365 INFO L432 NwaCegarLoop]: 110 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, 110 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 12:16:51,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:16:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 12:16:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 12:16:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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 12:16:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-11 12:16:51,423 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 161 [2024-10-11 12:16:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:51,424 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-11 12:16:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 12:16:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-11 12:16:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 12:16:51,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:51,427 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, 1, 1, 1, 1, 1] [2024-10-11 12:16:51,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:16:51,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash -982126838, now seen corresponding path program 1 times [2024-10-11 12:16:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929748780] [2024-10-11 12:16:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:16:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:16:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:16:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:16:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:16:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:16:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:16:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:16:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:16:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 12:16:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:16:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 12:16:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:16:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:16:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 12:16:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 12:16:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 12:16:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 12:16:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929748780] [2024-10-11 12:16:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929748780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:16:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054489410] [2024-10-11 12:16:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:52,313 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 12:16:52,316 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 12:16:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:52,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:16:52,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 684 proven. 9 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-10-11 12:16:52,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:16:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 12:16:53,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054489410] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:16:53,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:16:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-10-11 12:16:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547226170] [2024-10-11 12:16:53,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:16:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:16:53,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:16:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:16:53,147 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-11 12:16:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:53,913 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2024-10-11 12:16:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 12:16:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 161 [2024-10-11 12:16:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:53,919 INFO L225 Difference]: With dead ends: 200 [2024-10-11 12:16:53,919 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 12:16:53,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=621, Unknown=0, NotChecked=0, Total=870 [2024-10-11 12:16:53,921 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 142 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:53,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 425 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:16:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 12:16:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-10-11 12:16:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 72 states have internal predecessors, (86), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 12:16:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2024-10-11 12:16:53,942 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 161 [2024-10-11 12:16:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:53,942 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2024-10-11 12:16:53,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-10-11 12:16:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2024-10-11 12:16:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 12:16:53,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:53,947 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, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:53,962 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 12:16:54,150 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 12:16:54,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:54,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 433211295, now seen corresponding path program 1 times [2024-10-11 12:16:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140437721] [2024-10-11 12:16:54,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:16:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:16:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:16:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:16:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:16:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:16:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:16:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:16:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:16:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:16:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:16:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:16:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:16:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:16:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:16:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:16:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:16:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 12:16:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:16:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 12:16:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:16:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:16:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 12:16:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 12:16:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 12:16:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 12:16:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:16:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140437721] [2024-10-11 12:16:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140437721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:16:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594342957] [2024-10-11 12:16:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:54,876 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 12:16:54,877 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 12:16:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:54,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:16:55,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-11 12:16:55,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:16:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 12:16:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594342957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:16:55,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:16:55,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-11 12:16:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94875825] [2024-10-11 12:16:55,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:16:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 12:16:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:16:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 12:16:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:16:55,441 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:16:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:16:56,320 INFO L93 Difference]: Finished difference Result 322 states and 449 transitions. [2024-10-11 12:16:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 12:16:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 162 [2024-10-11 12:16:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:16:56,324 INFO L225 Difference]: With dead ends: 322 [2024-10-11 12:16:56,324 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 12:16:56,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 370 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 12:16:56,326 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 166 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:16:56,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 667 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:16:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 12:16:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2024-10-11 12:16:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 106 states have (on average 1.179245283018868) internal successors, (125), 108 states have internal predecessors, (125), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:16:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2024-10-11 12:16:56,359 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 162 [2024-10-11 12:16:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:16:56,360 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2024-10-11 12:16:56,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 12:16:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2024-10-11 12:16:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 12:16:56,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:16:56,362 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, 1, 1, 1, 1, 1, 1] [2024-10-11 12:16:56,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 12:16:56,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:56,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:16:56,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:16:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1134275873, now seen corresponding path program 1 times [2024-10-11 12:16:56,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:16:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883685058] [2024-10-11 12:16:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:16:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:16:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617374419] [2024-10-11 12:16:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:16:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:16:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:16:56,686 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 12:16:56,687 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 12:16:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:16:56,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 12:16:56,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:16:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 470 proven. 120 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-11 12:16:57,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:17:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:17:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883685058] [2024-10-11 12:17:06,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 12:17:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617374419] [2024-10-11 12:17:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617374419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:17:06,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:17:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 12:17:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731697379] [2024-10-11 12:17:06,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 12:17:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:17:06,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:17:06,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:17:06,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=111, Unknown=2, NotChecked=0, Total=156 [2024-10-11 12:17:06,275 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 12:17:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:08,083 INFO L93 Difference]: Finished difference Result 343 states and 455 transitions. [2024-10-11 12:17:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 12:17:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 162 [2024-10-11 12:17:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:08,087 INFO L225 Difference]: With dead ends: 343 [2024-10-11 12:17:08,089 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 12:17:08,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=84, Invalid=186, Unknown=2, NotChecked=0, Total=272 [2024-10-11 12:17:08,091 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:08,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 249 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 12:17:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 12:17:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 201. [2024-10-11 12:17:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 124 states have (on average 1.1451612903225807) internal successors, (142), 126 states have internal predecessors, (142), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:17:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 262 transitions. [2024-10-11 12:17:08,128 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 262 transitions. Word has length 162 [2024-10-11 12:17:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 262 transitions. [2024-10-11 12:17:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2024-10-11 12:17:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 262 transitions. [2024-10-11 12:17:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 12:17:08,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:08,131 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, 1, 1, 1, 1, 1, 1] [2024-10-11 12:17:08,147 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 12:17:08,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:08,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:08,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1880827745, now seen corresponding path program 1 times [2024-10-11 12:17:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:17:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393107597] [2024-10-11 12:17:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:17:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:17:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731932360] [2024-10-11 12:17:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:17:08,564 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:17:08,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 12:17:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:17:08,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:17:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:17:08,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:17:08,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:17:08,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:17:09,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 12:17:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:17:09,187 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 12:17:09,284 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:17:09,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:17:09 BoogieIcfgContainer [2024-10-11 12:17:09,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:17:09,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:17:09,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:17:09,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:17:09,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:16:50" (3/4) ... [2024-10-11 12:17:09,290 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:17:09,291 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:17:09,292 INFO L158 Benchmark]: Toolchain (without parser) took 19944.83ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 97.3MB in the beginning and 250.8MB in the end (delta: -153.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:17:09,292 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:17:09,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.73ms. Allocated memory is still 165.7MB. Free memory was 97.1MB in the beginning and 131.6MB in the end (delta: -34.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.99ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 124.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,292 INFO L158 Benchmark]: Boogie Preprocessor took 100.20ms. Allocated memory is still 165.7MB. Free memory was 124.0MB in the beginning and 107.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,293 INFO L158 Benchmark]: RCFGBuilder took 681.47ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 68.0MB in the end (delta: 39.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,293 INFO L158 Benchmark]: TraceAbstraction took 18676.65ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 67.4MB in the beginning and 251.8MB in the end (delta: -184.4MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,293 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 310.4MB. Free memory was 251.8MB in the beginning and 250.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:17:09,295 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.14ms. Allocated memory is still 165.7MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.73ms. Allocated memory is still 165.7MB. Free memory was 97.1MB in the beginning and 131.6MB in the end (delta: -34.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.99ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 124.0MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.20ms. Allocated memory is still 165.7MB. Free memory was 124.0MB in the beginning and 107.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 681.47ms. Allocated memory is still 165.7MB. Free memory was 107.2MB in the beginning and 68.0MB in the end (delta: 39.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18676.65ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 67.4MB in the beginning and 251.8MB in the end (delta: -184.4MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 310.4MB. Free memory was 251.8MB in the beginning and 250.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 177. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 16; [L25] unsigned char var_1_6 = 16; [L26] signed short int var_1_7 = -8; [L27] signed char var_1_9 = 0; [L28] signed char var_1_10 = -4; [L29] double var_1_11 = 2.25; [L30] double var_1_12 = 199.3; [L31] double var_1_13 = 7.2; [L32] unsigned long int var_1_14 = 10; [L33] signed short int var_1_15 = -4; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_19 = 256; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = -1; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned short int var_1_25 = 100; [L42] double var_1_26 = 15.125; [L43] double var_1_27 = 2.3; [L44] double var_1_28 = 999.25; [L45] double var_1_29 = 1.75; [L46] unsigned short int var_1_30 = 43183; [L47] unsigned long int var_1_31 = 100000; [L48] double var_1_32 = 7.4; [L49] double var_1_33 = 31.125; [L50] signed short int var_1_34 = -128; [L51] signed char var_1_35 = -1; [L52] signed char last_1_var_1_9 = 0; [L53] signed short int last_1_var_1_19 = 256; [L54] unsigned long int last_1_var_1_31 = 100000; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L172] last_1_var_1_9 = var_1_9 [L173] last_1_var_1_19 = var_1_19 [L174] last_1_var_1_31 = var_1_31 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=16, var_1_7=-8, var_1_9=0] [L136] var_1_6 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_7=-8, var_1_9=0] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_7=-8, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L138] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L145] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L158] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L160] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L161] var_1_29 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L162] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L164] var_1_30 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L165] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L166] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_33 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L185] RET updateVariables() [L186] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_0=256, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L59] COND TRUE last_1_var_1_31 != stepLocal_0 [L60] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L64] var_1_34 = var_1_1 [L65] var_1_14 = ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1))) [L66] unsigned char stepLocal_4 = var_1_28 == (var_1_27 + var_1_29); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_4=0, var_1_10=0, var_1_11=9/4, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=0, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L67] COND FALSE !((var_1_1 > var_1_30) && stepLocal_4) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=98303, var_1_31=100000, var_1_32=37/5, var_1_34=0, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L70] COND TRUE (var_1_29 / var_1_33) <= (- (var_1_12 + 10.1)) [L71] var_1_32 = var_1_26 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=-8, var_1_9=0] [L76] var_1_7 = ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=9/4, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L77] COND TRUE ((var_1_10 / var_1_4) / 1) <= var_1_1 [L78] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=-1, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L80] var_1_35 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L81] COND TRUE var_1_10 == var_1_34 [L82] var_1_20 = (var_1_6 + var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L84] unsigned char stepLocal_3 = var_1_13 < (var_1_32 * var_1_12); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_3=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L85] COND FALSE !(stepLocal_3 && var_1_16) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L88] unsigned long int stepLocal_2 = var_1_14 - var_1_5; [L89] unsigned long int stepLocal_1 = (((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4))); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L90] COND FALSE !(stepLocal_1 < (last_1_var_1_9 * (var_1_6 + var_1_20))) [L95] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L97] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L104] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L115] COND FALSE !(! var_1_24) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L118] var_1_21 = (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L119] COND FALSE !(var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) [L126] var_1_25 = (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-126, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return (((((((((((((((last_1_var_1_31 != last_1_var_1_19) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (((((50) > (var_1_5)) ? (50) : (var_1_5))) + var_1_6)))) && (var_1_7 == ((signed short int) ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1)))))) && ((((((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4)))) < (last_1_var_1_9 * (var_1_6 + var_1_20))) ? ((var_1_20 < (var_1_14 - var_1_5)) ? (var_1_9 == ((signed char) var_1_10)) : 1) : (var_1_9 == ((signed char) var_1_10)))) && ((((var_1_10 / var_1_4) / 1) <= var_1_1) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (var_1_14 == ((unsigned long int) ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1)))))) && (var_1_22 ? (var_1_22 ? (var_1_15 == ((signed short int) ((((((((var_1_9) > (1000)) ? (var_1_9) : (1000))) < 0 ) ? -((((var_1_9) > (1000)) ? (var_1_9) : (1000))) : ((((var_1_9) > (1000)) ? (var_1_9) : (1000))))) + var_1_4))) : (var_1_15 == ((signed short int) ((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9)))))) : 1)) && (var_1_22 ? ((var_1_20 > var_1_15) ? (var_1_19 == ((signed short int) (var_1_34 + var_1_10))) : ((var_1_15 < var_1_4) ? (var_1_19 == ((signed short int) var_1_4)) : (var_1_19 == ((signed short int) var_1_5)))) : 1)) && ((var_1_10 == var_1_34) ? (var_1_20 == ((unsigned char) (var_1_6 + var_1_5))) : 1)) && (var_1_21 == ((signed long int) (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20))))))) && (((var_1_13 < (var_1_32 * var_1_12)) && var_1_16) ? (var_1_22 == ((unsigned char) (var_1_23 && var_1_24))) : 1)) && ((var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (((var_1_13 / var_1_29) < var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_25 == ((unsigned short int) (((((var_1_14 + var_1_20)) < (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))) ? ((var_1_14 + var_1_20)) : (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))))))) : (var_1_25 == ((unsigned short int) (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))))))) && ((! var_1_24) ? (var_1_31 == ((unsigned long int) (var_1_34 + ((((var_1_20) < (var_1_6)) ? (var_1_20) : (var_1_6)))))) : 1)) && (((var_1_1 > var_1_30) && (var_1_28 == (var_1_27 + var_1_29))) ? (var_1_32 == ((double) ((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) : (((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) ? (var_1_32 == ((double) var_1_26)) : (var_1_32 == ((double) var_1_26))))) && (var_1_34 == ((signed short int) var_1_1))) && (var_1_35 == ((signed char) var_1_10)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=0, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=0, var_1_20=128, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32639, var_1_26=2, var_1_30=98303, var_1_31=100000, var_1_32=2, var_1_34=0, var_1_35=0, var_1_4=127, var_1_5=-129, var_1_6=1025, var_1_7=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 5, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 1451 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1885 IncrementalHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 447 mSDtfsCounter, 1885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1078 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=4, InterpolantAutomatonStates: 64, 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, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1284 ConstructedInterpolants, 0 QuantifiedInterpolants, 4471 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 9324/9600 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 12:17:09,517 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 12:17:09,564 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 137 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_operatoramount_amount100_file-91.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 ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:17:11,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:17:11,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:17:11,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:17:11,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:17:11,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:17:11,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:17:11,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:17:11,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:17:11,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:17:11,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:17:11,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:17:11,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:17:11,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:17:11,397 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:17:11,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:17:11,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:17:11,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:17:11,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:17:11,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:17:11,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:17:11,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:17:11,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:17:11,400 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:17:11,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:17:11,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:17:11,401 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:17:11,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:17:11,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:17:11,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:17:11,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:17:11,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:17:11,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:17:11,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:17:11,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:17:11,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:17:11,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:17:11,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:17:11,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:17:11,404 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:17:11,404 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 -> ae7fda48cb97f2fbb8cae5723a5eb71e78ce3d05ddea2d490a3a8ea1c4a83d60 [2024-10-11 12:17:11,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:17:11,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:17:11,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:17:11,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:17:11,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:17:11,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-10-11 12:17:13,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:17:13,276 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:17:13,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-91.i [2024-10-11 12:17:13,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8244e19ac/34894ed57d70419daa34c9cdd8bacbdb/FLAGf7a9b418c [2024-10-11 12:17:13,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8244e19ac/34894ed57d70419daa34c9cdd8bacbdb [2024-10-11 12:17:13,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:17:13,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:17:13,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:17:13,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:17:13,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:17:13,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9f7473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13, skipping insertion in model container [2024-10-11 12:17:13,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:17:13,488 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_operatoramount_amount100_file-91.i[916,929] [2024-10-11 12:17:13,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:17:13,612 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:17:13,623 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_operatoramount_amount100_file-91.i[916,929] [2024-10-11 12:17:13,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:17:13,698 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:17:13,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13 WrapperNode [2024-10-11 12:17:13,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:17:13,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:17:13,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:17:13,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:17:13,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,761 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-11 12:17:13,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:17:13,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:17:13,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:17:13,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:17:13,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,801 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 12:17:13,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:17:13,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:17:13,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:17:13,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:17:13,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (1/1) ... [2024-10-11 12:17:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:17:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:17:13,872 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 12:17:13,876 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 12:17:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:17:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:17:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:17:13,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:17:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:17:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:17:14,007 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:17:14,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:17:39,169 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 12:17:39,169 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:17:39,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:17:39,227 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:17:39,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:39 BoogieIcfgContainer [2024-10-11 12:17:39,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:17:39,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:17:39,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:17:39,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:17:39,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:17:13" (1/3) ... [2024-10-11 12:17:39,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ac9f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:39, skipping insertion in model container [2024-10-11 12:17:39,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:13" (2/3) ... [2024-10-11 12:17:39,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ac9f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:39, skipping insertion in model container [2024-10-11 12:17:39,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:39" (3/3) ... [2024-10-11 12:17:39,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-91.i [2024-10-11 12:17:39,251 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:17:39,251 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:17:39,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:17:39,317 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;@4ce43618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:17:39,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:17:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 12:17:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 12:17:39,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:39,337 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, 1, 1, 1, 1, 1] [2024-10-11 12:17:39,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1265559604, now seen corresponding path program 1 times [2024-10-11 12:17:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:17:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122095317] [2024-10-11 12:17:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:39,358 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 12:17:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:17:39,361 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 12:17:39,362 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 12:17:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:40,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:17:40,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:40,614 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 12:17:40,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:17:40,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:17:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122095317] [2024-10-11 12:17:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122095317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:17:40,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:17:40,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:17:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707789198] [2024-10-11 12:17:40,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:17:40,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:17:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:17:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:17:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:17:40,640 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 12:17:45,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:17:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:17:45,082 INFO L93 Difference]: Finished difference Result 147 states and 259 transitions. [2024-10-11 12:17:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:17:45,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 161 [2024-10-11 12:17:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:17:45,225 INFO L225 Difference]: With dead ends: 147 [2024-10-11 12:17:45,225 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 12:17:45,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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 12:17:45,231 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:17:45,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 12:17:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 12:17:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 12:17:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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 12:17:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-11 12:17:45,267 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 161 [2024-10-11 12:17:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:17:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-11 12:17:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 12:17:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-11 12:17:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 12:17:45,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:17:45,271 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, 1, 1, 1, 1, 1] [2024-10-11 12:17:45,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:17:45,471 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 12:17:45,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:17:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:17:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash -982126838, now seen corresponding path program 1 times [2024-10-11 12:17:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:17:45,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072860177] [2024-10-11 12:17:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:45,474 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 12:17:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:17:45,477 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 12:17:45,478 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 12:17:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:46,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:17:46,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-10-11 12:17:47,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:17:48,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:17:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072860177] [2024-10-11 12:17:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072860177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:17:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [513169784] [2024-10-11 12:17:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:17:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 12:17:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 12:17:48,380 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 12:17:48,383 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 12:17:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:17:50,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:17:50,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:17:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-10-11 12:17:51,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:17:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [513169784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:17:51,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:17:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 12:17:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997538077] [2024-10-11 12:17:51,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:17:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:17:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:17:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:17:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:17:51,879 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 12:18:00,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:18:04,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:18:08,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:18:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:18:08,242 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2024-10-11 12:18:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:18:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 12:18:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:18:08,396 INFO L225 Difference]: With dead ends: 151 [2024-10-11 12:18:08,397 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 12:18:08,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:18:08,400 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:18:08,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 192 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 15.9s Time] [2024-10-11 12:18:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 12:18:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-11 12:18:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 12:18:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-10-11 12:18:08,411 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 161 [2024-10-11 12:18:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:18:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-10-11 12:18:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 12:18:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-10-11 12:18:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 12:18:08,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:18:08,413 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, 1, 1, 1, 1, 1, 1] [2024-10-11 12:18:08,447 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:18:08,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 12:18:08,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 12:18:08,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:18:08,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:18:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 375952993, now seen corresponding path program 1 times [2024-10-11 12:18:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:18:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437350563] [2024-10-11 12:18:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:18:08,816 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 12:18:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:18:08,819 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:18:08,819 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 (5)] Waiting until timeout for monitored process [2024-10-11 12:18:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:10,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 12:18:10,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:18:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-10-11 12:18:17,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:18:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 75 proven. 66 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-11 12:18:23,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:18:23,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437350563] [2024-10-11 12:18:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437350563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:18:23,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:18:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-10-11 12:18:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096474204] [2024-10-11 12:18:23,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:18:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 12:18:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:18:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 12:18:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:18:23,623 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38)