./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.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_codestructure_normal_file-97.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', '5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c'] 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_codestructure_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:16:28,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:16:28,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:16:28,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:16:28,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:16:28,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:16:28,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:16:28,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:16:28,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:16:28,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:16:28,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:16:28,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:16:28,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:16:28,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:16:28,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:16:28,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:16:28,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:16:28,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:16:28,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:16:28,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:16:28,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:16:28,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:16:28,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:16:28,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:16:28,211 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-11-07 04:16:28,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:16:28,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:16:28,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:16:28,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:16:28,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:16:28,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-11-07 04:16:29,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:16:30,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:16:30,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-11-07 04:16:30,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1571b4c7/578680c574244aec8fc318e98b252b8c/FLAG6d8435023 [2024-11-07 04:16:30,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1571b4c7/578680c574244aec8fc318e98b252b8c [2024-11-07 04:16:30,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:16:30,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:16:30,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:16:30,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:16:30,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:16:30,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff5d61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30, skipping insertion in model container [2024-11-07 04:16:30,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:16:30,552 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_codestructure_normal_file-97.i[913,926] [2024-11-07 04:16:30,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:16:30,632 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:16:30,641 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_codestructure_normal_file-97.i[913,926] [2024-11-07 04:16:30,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:16:30,683 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:16:30,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30 WrapperNode [2024-11-07 04:16:30,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:16:30,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:16:30,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:16:30,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:16:30,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,746 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-07 04:16:30,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:16:30,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:16:30,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:16:30,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:16:30,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,797 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 04:16:30,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:16:30,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:16:30,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:16:30,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:16:30,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (1/1) ... [2024-11-07 04:16:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:16:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:16:30,883 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 04:16:30,889 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 04:16:30,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:16:30,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:16:30,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:16:30,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:16:30,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:16:30,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:16:30,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:16:30,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:16:31,494 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:16:31,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:16:31,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:16:31,509 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:16:31,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:16:31 BoogieIcfgContainer [2024-11-07 04:16:31,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:16:31,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:16:31,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:16:31,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:16:31,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:16:30" (1/3) ... [2024-11-07 04:16:31,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d12c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:16:31, skipping insertion in model container [2024-11-07 04:16:31,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:30" (2/3) ... [2024-11-07 04:16:31,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1d12c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:16:31, skipping insertion in model container [2024-11-07 04:16:31,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:16:31" (3/3) ... [2024-11-07 04:16:31,520 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-11-07 04:16:31,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:16:31,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:16:31,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:16:31,604 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;@eb1fec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:16:31,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:16:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 04:16:31,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:31,622 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:31,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:31,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1740945022, now seen corresponding path program 1 times [2024-11-07 04:16:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743143178] [2024-11-07 04:16:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:16:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:16:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:16:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:16:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:16:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:16:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:16:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:16:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:16:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:16:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:16:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 04:16:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:16:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 04:16:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:16:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:16:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:16:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:16:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743143178] [2024-11-07 04:16:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743143178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:16:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338785100] [2024-11-07 04:16:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:16:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:16:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:16:32,106 INFO L87 Difference]: Start difference. First operand has 98 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:16:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:32,148 INFO L93 Difference]: Finished difference Result 187 states and 320 transitions. [2024-11-07 04:16:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:16:32,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-07 04:16:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:32,156 INFO L225 Difference]: With dead ends: 187 [2024-11-07 04:16:32,156 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 04:16:32,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 04:16:32,164 INFO L432 NwaCegarLoop]: 137 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, 137 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 04:16:32,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:16:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 04:16:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 04:16:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2024-11-07 04:16:32,208 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 175 [2024-11-07 04:16:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2024-11-07 04:16:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:16:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2024-11-07 04:16:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 04:16:32,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:32,215 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:16:32,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1417604166, now seen corresponding path program 1 times [2024-11-07 04:16:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272884562] [2024-11-07 04:16:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:16:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:16:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:16:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:16:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:16:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:16:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:16:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:16:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:16:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:16:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:16:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 04:16:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:16:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 04:16:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:16:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:16:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:16:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:16:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272884562] [2024-11-07 04:16:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272884562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:16:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605275869] [2024-11-07 04:16:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:33,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:16:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:33,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:16:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:16:33,150 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:16:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:33,243 INFO L93 Difference]: Finished difference Result 183 states and 273 transitions. [2024-11-07 04:16:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:16:33,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-11-07 04:16:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:33,248 INFO L225 Difference]: With dead ends: 183 [2024-11-07 04:16:33,248 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 04:16:33,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:16:33,254 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:16:33,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 329 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:16:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 04:16:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-07 04:16:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-07 04:16:33,274 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 175 [2024-11-07 04:16:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:33,275 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-07 04:16:33,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:16:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-07 04:16:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 04:16:33,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:33,278 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:16:33,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:33,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:33,280 INFO L85 PathProgramCache]: Analyzing trace with hash -609137663, now seen corresponding path program 1 times [2024-11-07 04:16:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221999963] [2024-11-07 04:16:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 04:16:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 04:16:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 04:16:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 04:16:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:16:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 04:16:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:16:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 04:16:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:16:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 04:16:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 04:16:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 04:16:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 04:16:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 04:16:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 04:16:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 04:16:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 04:16:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:16:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221999963] [2024-11-07 04:16:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221999963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 04:16:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776411272] [2024-11-07 04:16:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:36,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 04:16:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 04:16:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:16:36,581 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:16:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:37,800 INFO L93 Difference]: Finished difference Result 253 states and 367 transitions. [2024-11-07 04:16:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 04:16:37,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-07 04:16:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:37,804 INFO L225 Difference]: With dead ends: 253 [2024-11-07 04:16:37,804 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 04:16:37,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:16:37,806 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 170 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:16:37,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 641 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:16:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 04:16:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2024-11-07 04:16:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2024-11-07 04:16:37,818 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 177 [2024-11-07 04:16:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2024-11-07 04:16:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:16:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2024-11-07 04:16:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 04:16:37,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:37,821 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:37,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:16:37,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:37,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1889001341, now seen corresponding path program 1 times [2024-11-07 04:16:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126210986] [2024-11-07 04:16:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:16:37,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:16:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:16:38,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:16:38,011 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:16:38,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:16:38,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:16:38,017 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 04:16:38,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:16:38,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:16:38 BoogieIcfgContainer [2024-11-07 04:16:38,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:16:38,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:16:38,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:16:38,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:16:38,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:16:31" (3/4) ... [2024-11-07 04:16:38,133 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:16:38,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:16:38,134 INFO L158 Benchmark]: Toolchain (without parser) took 7749.10ms. Allocated memory was 100.7MB in the beginning and 167.8MB in the end (delta: 67.1MB). Free memory was 77.3MB in the beginning and 88.9MB in the end (delta: -11.6MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,135 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:16:38,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.21ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 62.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.54ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 58.2MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:16:38,136 INFO L158 Benchmark]: Boogie Preprocessor took 93.60ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 52.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,137 INFO L158 Benchmark]: RCFGBuilder took 667.37ms. Allocated memory is still 100.7MB. Free memory was 52.1MB in the beginning and 61.2MB in the end (delta: -9.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,138 INFO L158 Benchmark]: TraceAbstraction took 6617.45ms. Allocated memory was 100.7MB in the beginning and 167.8MB in the end (delta: 67.1MB). Free memory was 60.8MB in the beginning and 88.9MB in the end (delta: -28.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,138 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:16:38,140 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.39ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.21ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 62.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.54ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 58.2MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 93.60ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 52.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 667.37ms. Allocated memory is still 100.7MB. Free memory was 52.1MB in the beginning and 61.2MB in the end (delta: -9.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6617.45ms. Allocated memory was 100.7MB in the beginning and 167.8MB in the end (delta: 67.1MB). Free memory was 60.8MB in the beginning and 88.9MB in the end (delta: -28.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 167.8MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. 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 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; VAL [isInitial=0, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_2=16, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L95] var_1_3 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] var_1_6 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L108] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L123] var_1_18 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L126] var_1_19 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L129] var_1_21 = __VERIFIER_nondet_long() [L130] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L132] var_1_23 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L147] RET updateVariables() [L148] CALL step() [L48] COND FALSE !((var_1_2 + var_1_3) < -200) [L59] var_1_1 = var_1_2 VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L61] COND TRUE 256 > (var_1_3 - (var_1_2 + var_1_6)) [L62] var_1_5 = var_1_2 VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L72] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L75] COND TRUE \read(var_1_7) [L76] var_1_15 = var_1_6 VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L79] COND FALSE !(\read(var_1_4)) [L86] var_1_17 = -32 VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=-64, var_1_21=0, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L88] var_1_20 = var_1_21 [L89] var_1_22 = var_1_23 VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139-L140] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=127, var_1_13=63, var_1_14=59, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 720 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 387 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 59 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 3568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 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 04:16:38,181 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_codestructure_normal_file-97.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 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:16:40,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:16:40,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:16:40,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:16:40,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:16:40,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:16:40,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:16:40,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:16:40,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:16:40,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:16:40,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:16:40,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:16:40,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:16:40,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:16:40,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:16:40,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:16:40,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:16:40,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:16:40,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:16:40,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:16:40,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:16:40,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:16:40,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:16:40,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:16:40,629 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 -> 5f7089906045f68da9fc900e2f38b68a58c1b0c4f2e88e8e487f0f744e1e424c [2024-11-07 04:16:40,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:16:40,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:16:40,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:16:40,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:16:40,952 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:16:40,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-11-07 04:16:42,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:16:42,617 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:16:42,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-97.i [2024-11-07 04:16:42,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4192c501c/901ce80285ee4d6fb4a605ade62d25e2/FLAG3c0259b06 [2024-11-07 04:16:42,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4192c501c/901ce80285ee4d6fb4a605ade62d25e2 [2024-11-07 04:16:42,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:16:42,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:16:42,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:16:42,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:16:42,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:16:42,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:16:42" (1/1) ... [2024-11-07 04:16:42,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43aebd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:42, skipping insertion in model container [2024-11-07 04:16:42,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:16:42" (1/1) ... [2024-11-07 04:16:42,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:16:43,087 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_codestructure_normal_file-97.i[913,926] [2024-11-07 04:16:43,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:16:43,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:16:43,169 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_codestructure_normal_file-97.i[913,926] [2024-11-07 04:16:43,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:16:43,216 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:16:43,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43 WrapperNode [2024-11-07 04:16:43,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:16:43,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:16:43,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:16:43,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:16:43,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,263 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-07 04:16:43,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:16:43,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:16:43,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:16:43,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:16:43,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,288 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 04:16:43,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:16:43,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:16:43,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:16:43,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:16:43,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (1/1) ... [2024-11-07 04:16:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:16:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:16:43,352 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 04:16:43,354 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 04:16:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:16:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:16:43,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:16:43,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:16:43,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:16:43,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:16:43,443 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:16:43,445 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:16:43,715 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:16:43,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:16:43,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:16:43,724 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:16:43,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:16:43 BoogieIcfgContainer [2024-11-07 04:16:43,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:16:43,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:16:43,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:16:43,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:16:43,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:16:42" (1/3) ... [2024-11-07 04:16:43,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e271ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:16:43, skipping insertion in model container [2024-11-07 04:16:43,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:16:43" (2/3) ... [2024-11-07 04:16:43,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e271ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:16:43, skipping insertion in model container [2024-11-07 04:16:43,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:16:43" (3/3) ... [2024-11-07 04:16:43,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2024-11-07 04:16:43,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:16:43,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:16:43,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:16:43,824 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;@6e73fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:16:43,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:16:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 04:16:43,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:43,841 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:43,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -948117709, now seen corresponding path program 1 times [2024-11-07 04:16:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:16:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963429364] [2024-11-07 04:16:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:43,854 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 04:16:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:16:43,856 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 04:16:43,858 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 04:16:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:44,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:16:44,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:16:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-07 04:16:44,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:16:44,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:16:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963429364] [2024-11-07 04:16:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963429364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:16:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831303523] [2024-11-07 04:16:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:16:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:16:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:16:44,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:16:44,198 INFO L87 Difference]: Start difference. First operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:16:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:44,231 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2024-11-07 04:16:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:16:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-11-07 04:16:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:44,241 INFO L225 Difference]: With dead ends: 139 [2024-11-07 04:16:44,241 INFO L226 Difference]: Without dead ends: 68 [2024-11-07 04:16:44,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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 04:16:44,250 INFO L432 NwaCegarLoop]: 101 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, 101 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 04:16:44,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:16:44,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-07 04:16:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-07 04:16:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:16:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-07 04:16:44,297 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 171 [2024-11-07 04:16:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:44,298 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-07 04:16:44,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:16:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-07 04:16:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 04:16:44,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:44,303 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:44,312 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 04:16:44,504 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 04:16:44,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:44,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1600685047, now seen corresponding path program 1 times [2024-11-07 04:16:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:16:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415487314] [2024-11-07 04:16:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:44,507 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 04:16:44,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:16:44,510 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 04:16:44,511 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 04:16:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:44,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 04:16:44,763 INFO L278 TraceCheckSpWp]: Computing forward predicates...