./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:43:35,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:43:35,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:43:35,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:43:35,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:43:35,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:43:35,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:43:35,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:43:35,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:43:35,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:43:35,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:43:35,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:43:35,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:43:35,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:43:35,911 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:43:35,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:43:35,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:43:35,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:43:35,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:35,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:43:35,913 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a [2024-11-07 05:43:36,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:43:36,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:43:36,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:43:36,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:43:36,188 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:43:36,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:37,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:43:37,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:43:37,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:37,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/def6eb44f/29c5160495754876a430500aabae0ecf/FLAG7e641790d [2024-11-07 05:43:37,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/def6eb44f/29c5160495754876a430500aabae0ecf [2024-11-07 05:43:37,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:43:37,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:43:37,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:37,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:43:37,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:43:37,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:37,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a9ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37, skipping insertion in model container [2024-11-07 05:43:37,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:37,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:43:37,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2024-11-07 05:43:37,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:37,940 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:43:37,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2024-11-07 05:43:37,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:37,997 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:43:37,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37 WrapperNode [2024-11-07 05:43:37,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:37,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:38,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:43:38,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:43:38,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,061 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-07 05:43:38,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:38,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:43:38,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:43:38,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:43:38,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,106 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-07 05:43:38,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:43:38,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:43:38,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:43:38,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:43:38,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (1/1) ... [2024-11-07 05:43:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:38,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:38,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:43:38,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:43:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:43:38,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:43:38,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:43:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:43:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:43:38,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:43:38,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:43:38,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:43:38,698 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 05:43:38,699 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:43:38,708 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:43:38,708 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:43:38,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:38 BoogieIcfgContainer [2024-11-07 05:43:38,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:43:38,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:43:38,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:43:38,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:43:38,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:43:37" (1/3) ... [2024-11-07 05:43:38,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b077835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:38, skipping insertion in model container [2024-11-07 05:43:38,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:37" (2/3) ... [2024-11-07 05:43:38,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b077835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:38, skipping insertion in model container [2024-11-07 05:43:38,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:38" (3/3) ... [2024-11-07 05:43:38,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:38,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:43:38,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:43:38,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:43:38,794 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;@6c595d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:43:38,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:43:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:43:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 05:43:38,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:38,814 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:43:38,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:38,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash -645111193, now seen corresponding path program 1 times [2024-11-07 05:43:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178205064] [2024-11-07 05:43:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:38,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:43:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:43:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:43:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:43:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:43:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 05:43:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178205064] [2024-11-07 05:43:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178205064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:43:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218419017] [2024-11-07 05:43:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:39,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:43:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:43:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:43:39,247 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:43:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:39,277 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2024-11-07 05:43:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:43:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-11-07 05:43:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:39,287 INFO L225 Difference]: With dead ends: 161 [2024-11-07 05:43:39,288 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 05:43:39,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-07 05:43:39,296 INFO L432 NwaCegarLoop]: 122 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, 122 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-07 05:43:39,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:43:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 05:43:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 05:43:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:43:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-07 05:43:39,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 142 [2024-11-07 05:43:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-07 05:43:39,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:43:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-07 05:43:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 05:43:39,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:39,341 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:43:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:43:39,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:39,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1263176125, now seen corresponding path program 1 times [2024-11-07 05:43:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213078962] [2024-11-07 05:43:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:43:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:43:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:43:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:43:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:43:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:43:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:43:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:43:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:43:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:43:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:43:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:43:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:43:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:43:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:43:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:43:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:43:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:43:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:43:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:43:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:43:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 05:43:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:43:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213078962] [2024-11-07 05:43:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213078962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:39,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:39,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:43:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966588038] [2024-11-07 05:43:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:43:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:43:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:43:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:43:39,656 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:43:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:39,769 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-11-07 05:43:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:43:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-07 05:43:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:39,772 INFO L225 Difference]: With dead ends: 193 [2024-11-07 05:43:39,772 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 05:43:39,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:43:39,775 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 41 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:43:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 231 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:43:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 05:43:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-07 05:43:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:43:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-11-07 05:43:39,797 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 143 [2024-11-07 05:43:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-11-07 05:43:39,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:43:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-11-07 05:43:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 05:43:39,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:39,806 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:43:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:43:39,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 28184579, now seen corresponding path program 1 times [2024-11-07 05:43:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:43:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497471961] [2024-11-07 05:43:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:43:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:43:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521952311] [2024-11-07 05:43:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:39,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:43:39,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 05:43:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:43:40,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:43:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:43:40,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:43:40,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:43:40,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:43:40,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:43:40,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:43:40,533 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 05:43:40,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:43:40,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:43:40 BoogieIcfgContainer [2024-11-07 05:43:40,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:43:40,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:43:40,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:43:40,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:43:40,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:38" (3/4) ... [2024-11-07 05:43:40,649 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:43:40,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:43:40,651 INFO L158 Benchmark]: Toolchain (without parser) took 2916.68ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 91.3MB in the beginning and 106.6MB in the end (delta: -15.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-07 05:43:40,652 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:40,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.90ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 76.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:43:40,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.21ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:40,653 INFO L158 Benchmark]: Boogie Preprocessor took 76.95ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 65.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:43:40,654 INFO L158 Benchmark]: RCFGBuilder took 567.92ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 84.0MB in the end (delta: -18.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 05:43:40,654 INFO L158 Benchmark]: TraceAbstraction took 1935.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 83.5MB in the beginning and 106.6MB in the end (delta: -23.1MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-07 05:43:40,654 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 106.6MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:43:40,656 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.90ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 76.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.21ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 71.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.95ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 65.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 567.92ms. Allocated memory is still 117.4MB. Free memory was 65.8MB in the beginning and 84.0MB in the end (delta: -18.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1935.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 83.5MB in the beginning and 106.6MB in the end (delta: -23.1MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 106.6MB in the end (delta: 33.8kB). 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 168, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] unsigned short int var_1_8 = 100; [L29] float var_1_9 = 255.75; [L30] signed char var_1_10 = 64; [L31] signed char var_1_11 = 32; [L32] signed char var_1_12 = 4; [L33] float var_1_13 = 0.0; [L34] float var_1_14 = 7.25; [L35] float var_1_15 = 8.125; [L36] float var_1_16 = 24.5; [L37] signed short int var_1_17 = -256; [L38] double var_1_18 = 31.5; [L39] float var_1_19 = 255.2; [L40] signed long int var_1_21 = -8; [L41] double var_1_22 = 0.5; [L42] unsigned short int var_1_23 = 200; [L43] double var_1_26 = 1.8; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_37 = 1; [L46] unsigned char var_1_39 = 0; [L47] unsigned char var_1_40 = 0; [L48] unsigned long int var_1_41 = 10; [L49] unsigned char last_1_var_1_6 = 32; [L50] unsigned short int last_1_var_1_8 = 100; VAL [isInitial=0, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_6 = var_1_6 [L165] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L129] var_1_2 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L130] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L132] var_1_3 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L133] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L136] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L141] var_1_10 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L142] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L144] var_1_11 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L145] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L147] var_1_12 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L148] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L151] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L153] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L154] var_1_16 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L155] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L156] var_1_39 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L157] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] CALL assume_abort_if_not(var_1_40 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] RET assume_abort_if_not(var_1_40 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L176] RET updateVariables() [L177] CALL step() [L54] signed long int stepLocal_0 = 64 + (var_1_5 / var_1_3); VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_0=65, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L55] COND TRUE stepLocal_0 != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6)) [L56] var_1_6 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100, var_1_9=1023/4] [L60] COND FALSE !(\read(var_1_2)) [L63] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100, var_1_9=1023/4] [L65] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L66] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L70] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L71] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L74] COND TRUE var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13)))) [L75] var_1_17 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=1, var_1_18=63/2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L80] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) [L85] var_1_18 = var_1_16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L87] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_1=0, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=100] [L88] COND TRUE (var_1_17 + var_1_6) >= stepLocal_1 [L89] var_1_8 = ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=1276/5, var_1_1=128, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L93] var_1_19 = var_1_16 [L94] var_1_21 = -16 [L95] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L96] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L103] COND FALSE !(var_1_5 > var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L106] COND FALSE !((var_1_2 || var_1_2) || ((- var_1_16) <= var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L110] COND FALSE !(var_1_2 || (var_1_16 <= var_1_16)) [L117] var_1_29 = (var_1_4 + (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) + var_1_5)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L119] COND TRUE var_1_2 || (var_1_17 <= (var_1_5 / var_1_3)) [L120] var_1_37 = (var_1_39 || var_1_40) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L122] COND FALSE !((var_1_4 + ((((var_1_10) < (var_1_3)) ? (var_1_10) : (var_1_3)))) <= var_1_4) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L168-L169] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=3, var_1_16=2, var_1_17=1, var_1_18=2, var_1_19=2, var_1_1=128, var_1_21=-16, var_1_22=3, var_1_23=200, var_1_26=9/5, var_1_29=255, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=127, var_1_40=0, var_1_41=10, var_1_4=769, var_1_5=-897, var_1_6=769, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 255 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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-07 05:43:40,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:43:42,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:43:42,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:43:42,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:43:42,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:43:42,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:43:42,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:43:42,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:43:42,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:43:42,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:43:42,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:43:42,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:43:42,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:43:42,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:43:42,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:43:42,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:43:42,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:43:42,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:43:42,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:42,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:43:42,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:43:42,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:43:42,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:43:42,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:43:42,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4fec42760cab0c7921ee441a80b2db245828099f977d4542ad766988bcefeb3a [2024-11-07 05:43:43,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:43:43,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:43:43,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:43:43,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:43:43,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:43:43,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:44,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:43:44,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:43:44,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:44,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c858d521/e2ebc19db5314bd28167480181ce25e5/FLAG01f776387 [2024-11-07 05:43:44,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c858d521/e2ebc19db5314bd28167480181ce25e5 [2024-11-07 05:43:44,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:43:44,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:43:44,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:44,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:43:44,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:43:44,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e171133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44, skipping insertion in model container [2024-11-07 05:43:44,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:43:44,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2024-11-07 05:43:44,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:44,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:43:44,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i[919,932] [2024-11-07 05:43:44,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:43:44,805 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:43:44,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44 WrapperNode [2024-11-07 05:43:44,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:43:44,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:44,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:43:44,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:43:44,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,863 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-07 05:43:44,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:43:44,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:43:44,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:43:44,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:43:44,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,904 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-07 05:43:44,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:43:44,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:43:44,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:43:44,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:43:44,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (1/1) ... [2024-11-07 05:43:44,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:43:44,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:43:44,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:43:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:43:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:43:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:43:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:43:45,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:43:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:43:45,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:43:45,082 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:43:45,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:43:52,273 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 05:43:52,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:43:52,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:43:52,286 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:43:52,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:52 BoogieIcfgContainer [2024-11-07 05:43:52,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:43:52,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:43:52,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:43:52,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:43:52,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:43:44" (1/3) ... [2024-11-07 05:43:52,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5903502f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:52, skipping insertion in model container [2024-11-07 05:43:52,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:43:44" (2/3) ... [2024-11-07 05:43:52,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5903502f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:43:52, skipping insertion in model container [2024-11-07 05:43:52,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:43:52" (3/3) ... [2024-11-07 05:43:52,296 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-20.i [2024-11-07 05:43:52,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:43:52,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:43:52,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:43:52,375 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;@ab91cc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:43:52,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:43:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:43:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:43:52,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:52,389 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:43:52,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:52,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -849164035, now seen corresponding path program 1 times [2024-11-07 05:43:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:43:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529800165] [2024-11-07 05:43:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:52,406 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-07 05:43:52,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:43:52,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-07 05:43:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 05:43:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:52,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:43:52,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:43:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-07 05:43:52,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:43:52,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:43:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529800165] [2024-11-07 05:43:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529800165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:43:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867855232] [2024-11-07 05:43:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:52,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:43:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:43:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:43:52,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:43:52,874 INFO L87 Difference]: Start difference. First operand has 72 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:43:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:43:52,891 INFO L93 Difference]: Finished difference Result 137 states and 239 transitions. [2024-11-07 05:43:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:43:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-07 05:43:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:43:52,896 INFO L225 Difference]: With dead ends: 137 [2024-11-07 05:43:52,896 INFO L226 Difference]: Without dead ends: 68 [2024-11-07 05:43:52,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-07 05:43:52,901 INFO L432 NwaCegarLoop]: 104 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, 104 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-07 05:43:52,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:43:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-07 05:43:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-07 05:43:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:43:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-07 05:43:52,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 140 [2024-11-07 05:43:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:43:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-07 05:43:52,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:43:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-07 05:43:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 05:43:52,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:43:52,935 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:43:52,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 05:43:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-07 05:43:53,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:43:53,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:43:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1987001314, now seen corresponding path program 1 times [2024-11-07 05:43:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:43:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279933981] [2024-11-07 05:43:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:43:53,137 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-07 05:43:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:43:53,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-07 05:43:53,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 05:43:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:43:53,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:43:53,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:43:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 05:43:53,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:43:53,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:43:53,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279933981] [2024-11-07 05:43:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279933981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:43:53,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:43:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:43:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939200761] [2024-11-07 05:43:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:43:53,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:43:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:43:53,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:43:53,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:43:53,700 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:43:58,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:44:02,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:44:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:02,413 INFO L93 Difference]: Finished difference Result 157 states and 241 transitions. [2024-11-07 05:44:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:44:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-07 05:44:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:02,415 INFO L225 Difference]: With dead ends: 157 [2024-11-07 05:44:02,415 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 05:44:02,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:44:02,416 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:02,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 188 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 05:44:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 05:44:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2024-11-07 05:44:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 05:44:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-07 05:44:02,427 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 141 [2024-11-07 05:44:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:02,429 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-07 05:44:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:44:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-07 05:44:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 05:44:02,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:02,431 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:44:02,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:44:02,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-07 05:44:02,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:02,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash -637603074, now seen corresponding path program 1 times [2024-11-07 05:44:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117578756] [2024-11-07 05:44:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:02,633 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-07 05:44:02,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:02,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-07 05:44:02,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-07 05:44:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:02,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:44:02,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 05:44:03,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:44:03,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:03,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117578756] [2024-11-07 05:44:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117578756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:44:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270431716] [2024-11-07 05:44:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:03,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:44:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:44:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:44:03,302 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:44:06,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:08,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:13,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:44:17,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:22,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:26,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:30,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:44:34,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:38,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:38,153 INFO L93 Difference]: Finished difference Result 236 states and 345 transitions. [2024-11-07 05:44:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:44:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-07 05:44:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:38,158 INFO L225 Difference]: With dead ends: 236 [2024-11-07 05:44:38,158 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 05:44:38,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:44:38,160 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:38,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 287 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 34.8s Time] [2024-11-07 05:44:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 05:44:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 136. [2024-11-07 05:44:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 97 states have internal predecessors, (124), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:44:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2024-11-07 05:44:38,183 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 142 [2024-11-07 05:44:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:38,184 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2024-11-07 05:44:38,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 05:44:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2024-11-07 05:44:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 05:44:38,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:38,186 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:44:38,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2024-11-07 05:44:38,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-07 05:44:38,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1568153918, now seen corresponding path program 1 times [2024-11-07 05:44:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450478340] [2024-11-07 05:44:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:38,388 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-07 05:44:38,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:38,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-07 05:44:38,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 05:44:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:38,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 05:44:38,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 308 proven. 12 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-11-07 05:44:41,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 05:44:42,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450478340] [2024-11-07 05:44:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450478340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:44:42,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:44:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 05:44:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392101358] [2024-11-07 05:44:42,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:42,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:44:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:44:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:44:42,423 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:44:47,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:52,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:56,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 05:44:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:56,956 INFO L93 Difference]: Finished difference Result 274 states and 395 transitions. [2024-11-07 05:44:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:44:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 142 [2024-11-07 05:44:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:57,003 INFO L225 Difference]: With dead ends: 274 [2024-11-07 05:44:57,003 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 05:44:57,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:44:57,004 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:57,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 161 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 14.2s Time] [2024-11-07 05:44:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 05:44:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2024-11-07 05:44:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:44:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 184 transitions. [2024-11-07 05:44:57,018 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 184 transitions. Word has length 142 [2024-11-07 05:44:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:57,018 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 184 transitions. [2024-11-07 05:44:57,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:44:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 184 transitions. [2024-11-07 05:44:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 05:44:57,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:57,020 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:44:57,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 05:44:57,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-07 05:44:57,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1087304343, now seen corresponding path program 1 times [2024-11-07 05:44:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994772064] [2024-11-07 05:44:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:57,225 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-07 05:44:57,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:57,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-07 05:44:57,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2024-11-07 05:44:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:57,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 05:44:57,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 24 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 05:44:58,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:58,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994772064] [2024-11-07 05:44:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994772064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587945071] [2024-11-07 05:44:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:44:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:44:58,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:44:58,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 05:45:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:00,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:45:00,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 24 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 05:45:00,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:45:01,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [587945071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:45:01,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:45:01,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-07 05:45:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888215423] [2024-11-07 05:45:01,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:45:01,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:45:01,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:45:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:45:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:45:01,355 INFO L87 Difference]: Start difference. First operand 129 states and 184 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:45:06,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:10,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:12,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:45:12,729 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2024-11-07 05:45:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:45:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-07 05:45:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:45:12,773 INFO L225 Difference]: With dead ends: 267 [2024-11-07 05:45:12,773 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 05:45:12,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:45:12,774 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:45:12,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 175 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2024-11-07 05:45:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 05:45:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-07 05:45:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 05:45:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2024-11-07 05:45:12,785 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 143 [2024-11-07 05:45:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:45:12,786 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2024-11-07 05:45:12,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 05:45:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2024-11-07 05:45:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 05:45:12,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:45:12,788 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:45:12,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-07 05:45:13,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Ended with exit code 0 [2024-11-07 05:45:13,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/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-07 05:45:13,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:45:13,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:45:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1432655591, now seen corresponding path program 1 times [2024-11-07 05:45:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:45:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32453966] [2024-11-07 05:45:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:13,191 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-07 05:45:13,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:45:13,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-07 05:45:13,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Waiting until timeout for monitored process [2024-11-07 05:45:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:13,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 05:45:13,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 562 proven. 153 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-07 05:45:19,916 INFO L311 TraceCheckSpWp]: Computing backward predicates...