./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:00:46,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:00:46,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:00:46,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:00:46,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:00:46,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:00:46,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:00:46,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:00:46,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:00:46,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:00:46,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:00:46,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:00:46,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:00:46,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:00:46,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:00:46,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:00:46,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:00:46,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:00:46,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:00:46,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:00:46,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:00:46,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:00:46,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:00:46,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:00:46,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:00:46,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:00:46,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:00:46,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:00:46,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:00:46,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:00:46,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:00:46,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:00:46,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:00:46,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:00:46,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:00:46,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:00:46,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:00:46,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 [2024-11-16 13:00:46,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:00:46,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:00:46,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:00:46,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:00:46,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:00:46,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:00:48,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:00:48,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:00:48,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:00:48,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9effcd85/0656bf6e62754aeca5e5a9aee03d269f/FLAG85441e1bb [2024-11-16 13:00:48,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9effcd85/0656bf6e62754aeca5e5a9aee03d269f [2024-11-16 13:00:48,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:00:48,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:00:48,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:00:48,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:00:48,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:00:48,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c18d15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48, skipping insertion in model container [2024-11-16 13:00:48,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:00:48,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2024-11-16 13:00:48,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:00:48,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:00:48,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2024-11-16 13:00:48,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:00:48,590 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:00:48,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48 WrapperNode [2024-11-16 13:00:48,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:00:48,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:00:48,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:00:48,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:00:48,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,645 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-16 13:00:48,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:00:48,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:00:48,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:00:48,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:00:48,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:00:48,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:00:48,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:00:48,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:00:48,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:00:48,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (1/1) ... [2024-11-16 13:00:48,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:00:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:00:48,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:00:48,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:00:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:00:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:00:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:00:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:00:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:00:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:00:48,873 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:00:48,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:00:49,144 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:00:49,145 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:00:49,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:00:49,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:00:49,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:00:49 BoogieIcfgContainer [2024-11-16 13:00:49,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:00:49,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:00:49,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:00:49,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:00:49,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:00:48" (1/3) ... [2024-11-16 13:00:49,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b69bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:00:49, skipping insertion in model container [2024-11-16 13:00:49,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:00:48" (2/3) ... [2024-11-16 13:00:49,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b69bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:00:49, skipping insertion in model container [2024-11-16 13:00:49,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:00:49" (3/3) ... [2024-11-16 13:00:49,171 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:00:49,185 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:00:49,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:00:49,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:00:49,252 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;@2c2a7b32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:00:49,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:00:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:00:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:00:49,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:00:49,271 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:00:49,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:00:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:00:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1268126854, now seen corresponding path program 1 times [2024-11-16 13:00:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:00:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099711018] [2024-11-16 13:00:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:00:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:00:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:00:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:00:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:00:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:00:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:00:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:00:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:00:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:00:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:00:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:00:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:00:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:00:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:00:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:00:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:00:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:00:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:00:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:00:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:00:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:00:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:00:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:00:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 13:00:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:00:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099711018] [2024-11-16 13:00:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099711018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:00:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:00:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:00:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307315690] [2024-11-16 13:00:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:00:49,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:00:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:00:49,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:00:49,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:00:49,682 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 13:00:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:00:49,704 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2024-11-16 13:00:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:00:49,709 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-16 13:00:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:00:49,715 INFO L225 Difference]: With dead ends: 138 [2024-11-16 13:00:49,715 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 13:00:49,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:00:49,721 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:00:49,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:00:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 13:00:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-16 13:00:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:00:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-11-16 13:00:49,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 151 [2024-11-16 13:00:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:00:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-11-16 13:00:49,824 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 13:00:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-11-16 13:00:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:00:49,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:00:49,827 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:00:49,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:00:49,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:00:49,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:00:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 196089353, now seen corresponding path program 1 times [2024-11-16 13:00:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:00:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343243781] [2024-11-16 13:00:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:00:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:00:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:00:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:00:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:00:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:00:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:00:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:00:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:00:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:00:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:00:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:00:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:00:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:00:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:00:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:00:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:00:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:00:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:00:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:00:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:00:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:00:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:00:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:00:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 13:00:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:00:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343243781] [2024-11-16 13:00:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343243781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:00:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:00:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:00:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495034472] [2024-11-16 13:00:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:00:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:00:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:00:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:00:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:00:50,281 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:00:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:00:50,471 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-11-16 13:00:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:00:50,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-16 13:00:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:00:50,475 INFO L225 Difference]: With dead ends: 197 [2024-11-16 13:00:50,475 INFO L226 Difference]: Without dead ends: 132 [2024-11-16 13:00:50,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:00:50,477 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 93 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:00:50,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 229 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:00:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-16 13:00:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 72. [2024-11-16 13:00:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:00:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2024-11-16 13:00:50,490 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 151 [2024-11-16 13:00:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:00:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2024-11-16 13:00:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:00:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-16 13:00:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:00:50,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:00:50,494 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:00:50,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:00:50,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:00:50,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:00:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1938899688, now seen corresponding path program 1 times [2024-11-16 13:00:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:00:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784621966] [2024-11-16 13:00:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:00:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:00:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:00:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:00:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:00:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:00:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:00:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:00:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:00:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:00:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:00:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:00:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:00:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:00:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:00:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:00:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:00:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:00:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:00:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:00:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:00:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:00:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:00:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:00:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-16 13:00:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:00:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784621966] [2024-11-16 13:00:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784621966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:00:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302044623] [2024-11-16 13:00:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:51,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:00:51,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:00:51,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:00:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 13:00:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:51,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 13:00:51,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:00:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 417 proven. 21 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-16 13:00:52,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:00:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 105 proven. 24 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-16 13:00:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302044623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:00:52,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:00:52,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 25 [2024-11-16 13:00:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903984373] [2024-11-16 13:00:52,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:00:52,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 13:00:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:00:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 13:00:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-16 13:00:52,793 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-16 13:00:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:00:54,363 INFO L93 Difference]: Finished difference Result 284 states and 393 transitions. [2024-11-16 13:00:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-16 13:00:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 151 [2024-11-16 13:00:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:00:54,366 INFO L225 Difference]: With dead ends: 284 [2024-11-16 13:00:54,366 INFO L226 Difference]: Without dead ends: 215 [2024-11-16 13:00:54,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=634, Invalid=2228, Unknown=0, NotChecked=0, Total=2862 [2024-11-16 13:00:54,368 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 409 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 13:00:54,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 765 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 13:00:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-16 13:00:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2024-11-16 13:00:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 110 states have internal predecessors, (126), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 13:00:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2024-11-16 13:00:54,393 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 151 [2024-11-16 13:00:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:00:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2024-11-16 13:00:54,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-16 13:00:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2024-11-16 13:00:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:00:54,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:00:54,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:00:54,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 13:00:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:00:54,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:00:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:00:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash 325172072, now seen corresponding path program 1 times [2024-11-16 13:00:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:00:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572626284] [2024-11-16 13:00:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:00:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:00:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:00:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:00:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:00:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:00:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:00:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:00:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:00:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 13:00:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:00:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:00:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:00:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 13:00:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:00:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 13:00:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:00:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 13:00:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:00:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:00:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:00:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:00:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:00:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:00:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:00:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 13:00:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:00:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572626284] [2024-11-16 13:00:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572626284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:00:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:00:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:00:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875144843] [2024-11-16 13:00:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:00:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:00:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:00:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:00:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:00:54,726 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:00:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:00:54,815 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2024-11-16 13:00:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:00:54,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-16 13:00:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:00:54,819 INFO L225 Difference]: With dead ends: 324 [2024-11-16 13:00:54,819 INFO L226 Difference]: Without dead ends: 179 [2024-11-16 13:00:54,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:00:54,820 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:00:54,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 139 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:00:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-16 13:00:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2024-11-16 13:00:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 106 states have internal predecessors, (119), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 13:00:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2024-11-16 13:00:54,843 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 243 transitions. Word has length 151 [2024-11-16 13:00:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:00:54,843 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 243 transitions. [2024-11-16 13:00:54,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:00:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 243 transitions. [2024-11-16 13:00:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:00:54,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:00:54,845 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:00:54,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:00:54,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:00:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:00:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2067982407, now seen corresponding path program 1 times [2024-11-16 13:00:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:00:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150771374] [2024-11-16 13:00:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:00:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:00:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622024948] [2024-11-16 13:00:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:00:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:00:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:00:54,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:00:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 13:00:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:00:55,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:00:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:00:55,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:00:55,429 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:00:55,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:00:55,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:00:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:00:55,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 13:00:55,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:00:55,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:00:55 BoogieIcfgContainer [2024-11-16 13:00:55,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:00:55,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:00:55,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:00:55,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:00:55,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:00:49" (3/4) ... [2024-11-16 13:00:55,746 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:00:55,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:00:55,748 INFO L158 Benchmark]: Toolchain (without parser) took 7430.19ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 91.8MB in the beginning and 183.9MB in the end (delta: -92.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,748 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:00:55,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.99ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 135.7MB in the end (delta: -44.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 131.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,750 INFO L158 Benchmark]: Boogie Preprocessor took 93.58ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 124.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,751 INFO L158 Benchmark]: IcfgBuilder took 420.26ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,751 INFO L158 Benchmark]: TraceAbstraction took 6580.63ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 100.1MB in the beginning and 183.9MB in the end (delta: -83.8MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-16 13:00:55,751 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 276.8MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:00:55,753 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.19ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.99ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 135.7MB in the end (delta: -44.2MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 131.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.58ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 124.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 420.26ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6580.63ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 100.1MB in the beginning and 183.9MB in the end (delta: -83.8MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 276.8MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticFLOAToperation at line 64, overapproximation of someUnaryFLOAToperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] unsigned char var_1_32 = 200; [L44] double var_1_33 = 31.625; [L45] double var_1_34 = 99999.67; [L46] signed long int var_1_35 = 10; [L47] unsigned short int var_1_36 = 5; [L48] unsigned long int var_1_38 = 10; [L49] unsigned short int var_1_39 = 0; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=0, var_1_8=1, var_1_9=-2] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L105] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] var_1_8 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L108] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] var_1_14 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L111] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] var_1_15 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L114] var_1_16 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L115] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] var_1_18 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L117] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L118] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L118] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L119] var_1_21 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L120] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L121] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L121] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L123] var_1_23 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L124] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L126] var_1_24 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_26 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_27 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] var_1_32 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_34 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET updateVariables() [L153] CALL step() [L53] var_1_31 = var_1_32 [L54] var_1_33 = var_1_34 [L55] var_1_35 = var_1_31 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L56] COND FALSE !(var_1_32 < var_1_35) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] var_1_38 = var_1_36 [L62] var_1_39 = 256 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L63] COND TRUE \read(var_1_8) [L64] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L66] COND TRUE \read(var_1_8) [L67] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L71] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L74] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_17 = ((var_1_18 - 25) - var_1_25) [L77] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L78] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L79] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L83] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L84] COND FALSE !((~ var_1_29) > stepLocal_3) [L87] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L89] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L90] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L91] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L100] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET step() [L154] CALL, EXPR property() [L144-L145] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=16356, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=16384, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=1, var_1_27=-256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 1233 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 827 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1072 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 406 mSDtfsCounter, 1072 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911 SizeOfPredicates, 5 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 6006/6072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 13:00:55,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:00:57,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:00:57,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:00:57,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:00:57,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:00:57,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:00:57,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:00:57,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:00:57,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:00:57,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:00:57,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:00:57,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:00:57,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:00:57,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:00:57,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:00:57,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:00:57,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:00:57,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:00:57,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:00:57,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:00:57,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:00:57,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:00:57,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:00:57,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:00:57,921 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:00:57,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:00:57,921 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:00:57,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:00:57,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:00:57,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:00:57,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:00:57,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:00:57,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:00:57,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:00:57,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:00:57,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:00:57,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:00:57,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:00:57,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:00:57,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:00:57,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:00:57,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:00:57,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:00:57,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:00:57,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 [2024-11-16 13:00:58,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:00:58,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:00:58,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:00:58,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:00:58,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:00:58,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:00:59,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:00:59,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:00:59,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:00:59,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0588cceb8/d4cfef053fe84db68f520cd03f58eba6/FLAG936e137f1 [2024-11-16 13:01:00,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0588cceb8/d4cfef053fe84db68f520cd03f58eba6 [2024-11-16 13:01:00,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:01:00,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:01:00,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:01:00,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:01:00,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:01:00,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1146b647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00, skipping insertion in model container [2024-11-16 13:01:00,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:01:00,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2024-11-16 13:01:00,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:01:00,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:01:00,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2024-11-16 13:01:00,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:01:00,598 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:01:00,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00 WrapperNode [2024-11-16 13:01:00,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:01:00,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:01:00,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:01:00,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:01:00,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,644 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-16 13:01:00,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:01:00,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:01:00,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:01:00,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:01:00,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:01:00,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:01:00,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:01:00,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:01:00,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:01:00,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (1/1) ... [2024-11-16 13:01:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:01:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:01:00,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:01:00,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:01:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:01:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:01:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:01:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:01:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:01:00,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:01:00,904 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:01:00,906 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:01:01,332 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:01:01,332 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:01:01,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:01:01,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:01:01,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:01:01 BoogieIcfgContainer [2024-11-16 13:01:01,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:01:01,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:01:01,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:01:01,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:01:01,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:01:00" (1/3) ... [2024-11-16 13:01:01,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6724cd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:01:01, skipping insertion in model container [2024-11-16 13:01:01,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:01:00" (2/3) ... [2024-11-16 13:01:01,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6724cd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:01:01, skipping insertion in model container [2024-11-16 13:01:01,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:01:01" (3/3) ... [2024-11-16 13:01:01,358 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-16 13:01:01,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:01:01,371 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:01:01,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:01:01,416 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;@567fb7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:01:01,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:01:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:01:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:01:01,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:01:01,431 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:01:01,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:01:01,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:01:01,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1268126854, now seen corresponding path program 1 times [2024-11-16 13:01:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:01:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360734432] [2024-11-16 13:01:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:01:01,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:01:01,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:01:01,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:01:01,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:01:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:01:01,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:01:01,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:01:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-16 13:01:01,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:01:01,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:01:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360734432] [2024-11-16 13:01:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360734432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:01:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:01:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:01:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355419545] [2024-11-16 13:01:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:01:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:01:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:01:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:01:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:01:01,779 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 13:01:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:01:01,803 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2024-11-16 13:01:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:01:01,804 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-16 13:01:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:01:01,810 INFO L225 Difference]: With dead ends: 138 [2024-11-16 13:01:01,811 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 13:01:01,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:01:01,816 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:01:01,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:01:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 13:01:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-16 13:01:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:01:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-11-16 13:01:01,858 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 151 [2024-11-16 13:01:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:01:01,859 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-11-16 13:01:01,859 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 13:01:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-11-16 13:01:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:01:01,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:01:01,862 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:01:01,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:01:02,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:01:02,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:01:02,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:01:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 196089353, now seen corresponding path program 1 times [2024-11-16 13:01:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:01:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498983517] [2024-11-16 13:01:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:01:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:01:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:01:02,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:01:02,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:01:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:01:02,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 13:01:02,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:01:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 13:01:02,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:01:02,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:01:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498983517] [2024-11-16 13:01:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498983517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:01:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:01:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:01:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844181061] [2024-11-16 13:01:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:01:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:01:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:01:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:01:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:01:02,579 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:01:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:01:02,791 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-11-16 13:01:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:01:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-16 13:01:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:01:02,794 INFO L225 Difference]: With dead ends: 183 [2024-11-16 13:01:02,794 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 13:01:02,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:01:02,796 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 92 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:01:02,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 419 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:01:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 13:01:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 68. [2024-11-16 13:01:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 13:01:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-16 13:01:02,806 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 151 [2024-11-16 13:01:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:01:02,807 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-16 13:01:02,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 13:01:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-16 13:01:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 13:01:02,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:01:02,809 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:01:02,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 13:01:03,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:01:03,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:01:03,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:01:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1938899688, now seen corresponding path program 1 times [2024-11-16 13:01:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:01:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171150156] [2024-11-16 13:01:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:01:03,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:01:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:01:03,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:01:03,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:01:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:01:03,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 13:01:03,268 INFO L278 TraceCheckSpWp]: Computing forward predicates...