./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 023d838f 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-023d838-m [2024-11-10 04:05:46,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:05:47,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:05:47,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:05:47,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:05:47,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:05:47,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:05:47,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:05:47,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:05:47,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:05:47,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:05:47,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:05:47,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:05:47,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:05:47,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:05:47,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:05:47,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:05:47,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:05:47,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:05:47,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:05:47,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:05:47,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:05:47,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:05:47,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:05:47,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:05:47,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:05:47,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:05:47,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:05:47,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:05:47,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:05:47,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:05:47,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:05:47,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:47,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:05:47,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:05:47,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:05:47,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:05:47,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:05:47,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:05:47,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:05:47,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:05:47,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:05:47,060 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-10 04:05:47,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:05:47,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:05:47,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:05:47,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:05:47,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:05:47,299 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-10 04:05:48,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:05:48,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:05:48,855 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-10 04:05:48,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae8dfd6c/a9c1acd1e85e41c5bdf39cc0601fe421/FLAG8c287c6a6 [2024-11-10 04:05:49,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae8dfd6c/a9c1acd1e85e41c5bdf39cc0601fe421 [2024-11-10 04:05:49,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:05:49,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:05:49,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:49,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:05:49,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:05:49,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30023cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49, skipping insertion in model container [2024-11-10 04:05:49,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:05:49,436 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-10 04:05:49,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:49,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:05:49,521 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-10 04:05:49,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:05:49,569 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:05:49,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49 WrapperNode [2024-11-10 04:05:49,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:05:49,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:49,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:05:49,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:05:49,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,641 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-10 04:05:49,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:05:49,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:05:49,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:05:49,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:05:49,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,690 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-10 04:05:49,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:05:49,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:05:49,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:05:49,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:05:49,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (1/1) ... [2024-11-10 04:05:49,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:49,754 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-10 04:05:49,760 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-10 04:05:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:05:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:05:49,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:05:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:05:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:05:49,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:05:49,949 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:05:49,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:05:50,309 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 04:05:50,312 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:05:50,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:05:50,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:05:50,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:50 BoogieIcfgContainer [2024-11-10 04:05:50,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:05:50,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:05:50,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:05:50,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:05:50,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:05:49" (1/3) ... [2024-11-10 04:05:50,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17defd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:50, skipping insertion in model container [2024-11-10 04:05:50,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:05:49" (2/3) ... [2024-11-10 04:05:50,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17defd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:05:50, skipping insertion in model container [2024-11-10 04:05:50,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:50" (3/3) ... [2024-11-10 04:05:50,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-10 04:05:50,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:05:50,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:05:50,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:05:50,421 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;@44768b52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:05:50,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:05:50,427 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-10 04:05:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:05:50,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:50,445 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-10 04:05:50,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:50,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1268126854, now seen corresponding path program 1 times [2024-11-10 04:05:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:50,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234619423] [2024-11-10 04:05:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:05:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:05:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:05:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:05:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:05:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:05:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:05:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:05:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:05:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:05:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:05:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:05:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:05:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:05:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:05:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:05:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:05:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:05:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:50,872 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-10 04:05:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234619423] [2024-11-10 04:05:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234619423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:50,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:50,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:05:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039179187] [2024-11-10 04:05:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:50,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:05:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:50,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:05:50,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:05:50,904 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-10 04:05:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:50,928 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2024-11-10 04:05:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:05:50,930 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-10 04:05:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:50,937 INFO L225 Difference]: With dead ends: 138 [2024-11-10 04:05:50,937 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 04:05:50,940 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-10 04:05:50,943 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-10 04:05:50,943 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-10 04:05:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 04:05:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-10 04:05:50,988 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-10 04:05:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-11-10 04:05:50,994 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 151 [2024-11-10 04:05:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:50,995 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-11-10 04:05:50,995 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-10 04:05:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-11-10 04:05:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:05:51,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:51,002 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-10 04:05:51,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:05:51,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 196089353, now seen corresponding path program 1 times [2024-11-10 04:05:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728883261] [2024-11-10 04:05:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:05:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:05:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:05:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:05:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:05:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:05:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:05:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:05:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:05:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:05:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:05:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:05:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:05:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:05:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:05:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:05:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:05:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:05:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:51,485 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-10 04:05:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728883261] [2024-11-10 04:05:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728883261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:51,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:51,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:05:51,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263696260] [2024-11-10 04:05:51,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:51,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:05:51,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:05:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:05:51,491 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-10 04:05:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:51,686 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-11-10 04:05:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:05:51,689 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-10 04:05:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:51,692 INFO L225 Difference]: With dead ends: 197 [2024-11-10 04:05:51,694 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 04:05:51,696 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-10 04:05:51,697 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-10 04:05:51,698 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-10 04:05:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 04:05:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 72. [2024-11-10 04:05:51,715 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-10 04:05:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2024-11-10 04:05:51,716 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 151 [2024-11-10 04:05:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2024-11-10 04:05:51,721 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-10 04:05:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-10 04:05:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:05:51,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:51,725 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-10 04:05:51,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:05:51,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1938899688, now seen corresponding path program 1 times [2024-11-10 04:05:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884123726] [2024-11-10 04:05:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:05:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:05:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:05:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:05:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:05:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:05:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:05:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:05:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:05:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:05:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:05:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:05:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:05:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:05:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:05:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:05:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:05:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:05:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:53,004 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-10 04:05:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884123726] [2024-11-10 04:05:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884123726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:05:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319338983] [2024-11-10 04:05:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:05:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:53,011 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-10 04:05:53,013 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-10 04:05:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:53,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 04:05:53,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:05:53,652 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-10 04:05:53,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:05:54,295 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-10 04:05:54,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319338983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:05:54,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:05:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 25 [2024-11-10 04:05:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392521556] [2024-11-10 04:05:54,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:05:54,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 04:05:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 04:05:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-10 04:05:54,301 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-10 04:05:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:55,941 INFO L93 Difference]: Finished difference Result 284 states and 393 transitions. [2024-11-10 04:05:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 04:05:55,942 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-10 04:05:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:55,944 INFO L225 Difference]: With dead ends: 284 [2024-11-10 04:05:55,944 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 04:05:55,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=634, Invalid=2228, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 04:05:55,949 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-10 04:05:55,950 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-10 04:05:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 04:05:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2024-11-10 04:05:55,977 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-10 04:05:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2024-11-10 04:05:55,979 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 151 [2024-11-10 04:05:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2024-11-10 04:05:55,980 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-10 04:05:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2024-11-10 04:05:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:05:55,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:55,982 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-10 04:05:56,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:05:56,182 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-10 04:05:56,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash 325172072, now seen corresponding path program 1 times [2024-11-10 04:05:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958889745] [2024-11-10 04:05:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:05:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:05:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:05:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:05:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:05:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:05:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:05:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:05:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 04:05:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:05:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:05:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:05:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:05:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:05:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:05:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:05:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:05:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:05:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:05:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:05:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:05:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:05:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:05:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:05:56,338 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-10 04:05:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:05:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958889745] [2024-11-10 04:05:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958889745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:05:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:05:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:05:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326613845] [2024-11-10 04:05:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:05:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:05:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:05:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:05:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:05:56,340 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-10 04:05:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:05:56,432 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2024-11-10 04:05:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:05:56,432 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-10 04:05:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:05:56,435 INFO L225 Difference]: With dead ends: 324 [2024-11-10 04:05:56,435 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 04:05:56,436 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-10 04:05:56,437 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-10 04:05:56,437 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-10 04:05:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 04:05:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2024-11-10 04:05:56,457 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-10 04:05:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2024-11-10 04:05:56,458 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 243 transitions. Word has length 151 [2024-11-10 04:05:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:05:56,459 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 243 transitions. [2024-11-10 04:05:56,459 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-10 04:05:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 243 transitions. [2024-11-10 04:05:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:05:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:05:56,465 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-10 04:05:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:05:56,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:05:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:05:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2067982407, now seen corresponding path program 1 times [2024-11-10 04:05:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:05:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61377535] [2024-11-10 04:05:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:05:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:05:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267539041] [2024-11-10 04:05:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:05:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:05:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:05:56,534 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-10 04:05:56,535 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-10 04:05:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:05:56,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:05:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:05:57,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:05:57,013 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:05:57,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:05:57,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 04:05:57,218 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-10 04:05:57,221 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 04:05:57,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:05:57,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:05:57 BoogieIcfgContainer [2024-11-10 04:05:57,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:05:57,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:05:57,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:05:57,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:05:57,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:05:50" (3/4) ... [2024-11-10 04:05:57,322 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:05:57,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:05:57,323 INFO L158 Benchmark]: Toolchain (without parser) took 8084.23ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 100.4MB in the beginning and 102.6MB in the end (delta: -2.2MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,325 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:05:57,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.48ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 83.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.89ms. Allocated memory is still 157.3MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,326 INFO L158 Benchmark]: Boogie Preprocessor took 72.76ms. Allocated memory is still 157.3MB. Free memory was 79.7MB in the beginning and 72.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,326 INFO L158 Benchmark]: IcfgBuilder took 613.49ms. Allocated memory is still 157.3MB. Free memory was 72.4MB in the beginning and 105.8MB in the end (delta: -33.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,326 INFO L158 Benchmark]: TraceAbstraction took 6985.41ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 105.8MB in the beginning and 102.6MB in the end (delta: 3.3MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2024-11-10 04:05:57,326 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 281.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:05:57,327 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.21ms. Allocated memory is still 157.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.48ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 83.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.89ms. Allocated memory is still 157.3MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.76ms. Allocated memory is still 157.3MB. Free memory was 79.7MB in the beginning and 72.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 613.49ms. Allocated memory is still 157.3MB. Free memory was 72.4MB in the beginning and 105.8MB in the end (delta: -33.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6985.41ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 105.8MB in the beginning and 102.6MB in the end (delta: 3.3MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 281.0MB. Free memory is still 102.6MB. 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.8s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, 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.1s 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.9s SatisfiabilityAnalysisTime, 2.8s 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-10 04:05:57,358 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-023d838-m [2024-11-10 04:05:59,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:05:59,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:05:59,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:05:59,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:05:59,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:05:59,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:05:59,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:05:59,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:05:59,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:05:59,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:05:59,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:05:59,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:05:59,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:05:59,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:05:59,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:05:59,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:05:59,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:05:59,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:05:59,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:05:59,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:05:59,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:05:59,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:05:59,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:05:59,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:05:59,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:05:59,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:05:59,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:05:59,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:05:59,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:05:59,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:05:59,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:05:59,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:05:59,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:05:59,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:05:59,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:05:59,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:05:59,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:05:59,466 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:05:59,466 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:05:59,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:05:59,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:05:59,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:05:59,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:05:59,467 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-10 04:05:59,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:05:59,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:05:59,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:05:59,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:05:59,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:05:59,802 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-10 04:06:01,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:06:01,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:06:01,453 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-10 04:06:01,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4305aaba/7cf390bd0a3c43a59cde36858c716916/FLAG7468384df [2024-11-10 04:06:01,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4305aaba/7cf390bd0a3c43a59cde36858c716916 [2024-11-10 04:06:01,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:06:01,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:06:01,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:06:01,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:06:01,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:06:01,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:06:01" (1/1) ... [2024-11-10 04:06:01,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc5d8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:01, skipping insertion in model container [2024-11-10 04:06:01,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:06:01" (1/1) ... [2024-11-10 04:06:01,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:06:01,987 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-10 04:06:02,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:06:02,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:06:02,099 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-10 04:06:02,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:06:02,158 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:06:02,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02 WrapperNode [2024-11-10 04:06:02,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:06:02,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:06:02,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:06:02,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:06:02,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,217 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-10 04:06:02,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:06:02,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:06:02,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:06:02,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:06:02,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,276 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-10 04:06:02,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:06:02,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:06:02,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:06:02,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:06:02,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (1/1) ... [2024-11-10 04:06:02,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:06:02,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:06:02,362 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-10 04:06:02,365 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-10 04:06:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:06:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:06:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:06:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:06:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:06:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:06:02,498 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:06:02,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:06:02,976 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 04:06:02,976 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:06:02,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:06:02,989 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:06:02,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:06:02 BoogieIcfgContainer [2024-11-10 04:06:02,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:06:02,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:06:02,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:06:02,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:06:02,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:06:01" (1/3) ... [2024-11-10 04:06:02,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1426f739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:02, skipping insertion in model container [2024-11-10 04:06:02,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:02" (2/3) ... [2024-11-10 04:06:02,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1426f739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:02, skipping insertion in model container [2024-11-10 04:06:02,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:06:02" (3/3) ... [2024-11-10 04:06:02,998 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2024-11-10 04:06:03,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:06:03,013 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:06:03,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:06:03,100 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;@1084f2b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:06:03,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:06:03,105 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-10 04:06:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:06:03,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:03,120 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-10 04:06:03,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1268126854, now seen corresponding path program 1 times [2024-11-10 04:06:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133166000] [2024-11-10 04:06:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:03,140 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-10 04:06:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:03,150 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-10 04:06:03,151 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-10 04:06:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:03,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:06:03,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:03,563 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-10 04:06:03,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:06:03,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:06:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133166000] [2024-11-10 04:06:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133166000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:06:03,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:06:03,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:06:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791682882] [2024-11-10 04:06:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:06:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:06:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:06:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:06:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:06:03,593 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-10 04:06:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:06:03,616 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2024-11-10 04:06:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:06:03,618 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-10 04:06:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:06:03,624 INFO L225 Difference]: With dead ends: 138 [2024-11-10 04:06:03,624 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 04:06:03,627 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-10 04:06:03,630 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-10 04:06:03,633 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-10 04:06:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 04:06:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-10 04:06:03,683 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-10 04:06:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-11-10 04:06:03,687 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 151 [2024-11-10 04:06:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:06:03,687 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-11-10 04:06:03,688 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-10 04:06:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-11-10 04:06:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:06:03,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:03,692 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-10 04:06:03,702 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-10 04:06:03,893 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-10 04:06:03,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 196089353, now seen corresponding path program 1 times [2024-11-10 04:06:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853660788] [2024-11-10 04:06:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:03,896 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-10 04:06:03,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:03,902 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-10 04:06:03,903 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-10 04:06:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:04,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 04:06:04,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:06:04,320 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-10 04:06:04,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:06:04,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:06:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853660788] [2024-11-10 04:06:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853660788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:06:04,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:06:04,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:06:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585035839] [2024-11-10 04:06:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:06:04,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:06:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:06:04,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:06:04,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:06:04,324 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-10 04:06:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:06:04,585 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-11-10 04:06:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:06:04,586 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-10 04:06:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:06:04,589 INFO L225 Difference]: With dead ends: 183 [2024-11-10 04:06:04,589 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 04:06:04,590 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-10 04:06:04,591 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-10 04:06:04,591 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-10 04:06:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 04:06:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 68. [2024-11-10 04:06:04,602 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-10 04:06:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-10 04:06:04,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 151 [2024-11-10 04:06:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:06:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-10 04:06:04,605 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-10 04:06:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-10 04:06:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 04:06:04,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:06:04,610 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-10 04:06:04,621 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-10 04:06:04,810 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-10 04:06:04,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:06:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:06:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1938899688, now seen corresponding path program 1 times [2024-11-10 04:06:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:06:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503898408] [2024-11-10 04:06:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:06:04,812 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-10 04:06:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:06:04,815 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-10 04:06:04,816 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-10 04:06:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:06:05,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 04:06:05,179 INFO L278 TraceCheckSpWp]: Computing forward predicates...