./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.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', 'd87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.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 d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:20:08,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:20:08,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:20:08,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:20:08,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:20:08,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:20:08,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:20:08,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:20:08,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:20:08,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:20:08,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:20:08,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:20:08,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:20:08,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:20:08,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:20:08,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:20:08,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:20:08,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:20:08,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:20:08,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:20:08,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:20:08,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:20:08,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:20:08,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:08,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:20:08,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:20:08,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:20:08,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:20:08,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:20:08,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:20:08,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:20:08,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:20:08,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:20:08,331 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 -> d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead [2024-11-07 06:20:08,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:20:08,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:20:08,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:20:08,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:20:08,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:20:08,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:10,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:20:10,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:20:10,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:10,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/374994193/88f71b608e2d4259ad5cfd2587e44a94/FLAGa01d772e2 [2024-11-07 06:20:10,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/374994193/88f71b608e2d4259ad5cfd2587e44a94 [2024-11-07 06:20:10,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:20:10,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:20:10,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:10,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:20:10,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:20:10,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c7d567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10, skipping insertion in model container [2024-11-07 06:20:10,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:20:10,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-07 06:20:10,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:10,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:20:10,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-07 06:20:10,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:10,622 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:20:10,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10 WrapperNode [2024-11-07 06:20:10,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:10,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:10,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:20:10,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:20:10,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,713 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-07 06:20:10,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:10,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:20:10,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:20:10,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:20:10,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,770 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 06:20:10,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:20:10,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:20:10,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:20:10,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:20:10,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (1/1) ... [2024-11-07 06:20:10,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:10,855 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 06:20:10,860 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 06:20:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:20:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:20:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:20:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:20:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:20:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:20:10,992 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:20:10,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:20:11,567 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:20:11,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:20:11,582 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:20:11,583 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:20:11,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:11 BoogieIcfgContainer [2024-11-07 06:20:11,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:20:11,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:20:11,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:20:11,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:20:11,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:20:10" (1/3) ... [2024-11-07 06:20:11,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77615512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:11, skipping insertion in model container [2024-11-07 06:20:11,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:10" (2/3) ... [2024-11-07 06:20:11,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77615512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:11, skipping insertion in model container [2024-11-07 06:20:11,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:11" (3/3) ... [2024-11-07 06:20:11,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:11,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:20:11,611 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:20:11,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:20:11,684 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;@7087b989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:20:11,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:20:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 06:20:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:11,703 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:11,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:11,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 279041345, now seen corresponding path program 1 times [2024-11-07 06:20:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504840919] [2024-11-07 06:20:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:20:12,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504840919] [2024-11-07 06:20:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504840919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:20:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845773645] [2024-11-07 06:20:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:12,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:20:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:20:12,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:20:12,312 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:20:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:12,354 INFO L93 Difference]: Finished difference Result 184 states and 323 transitions. [2024-11-07 06:20:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:20:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-07 06:20:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:12,397 INFO L225 Difference]: With dead ends: 184 [2024-11-07 06:20:12,398 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 06:20:12,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 06:20:12,407 INFO L432 NwaCegarLoop]: 140 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, 140 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 06:20:12,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:20:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 06:20:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 06:20:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-07 06:20:12,468 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 192 [2024-11-07 06:20:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-07 06:20:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:20:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-07 06:20:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 06:20:12,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:12,473 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:20:12,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1919348557, now seen corresponding path program 1 times [2024-11-07 06:20:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014222963] [2024-11-07 06:20:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:20:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014222963] [2024-11-07 06:20:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014222963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:20:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988393612] [2024-11-07 06:20:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:12,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:20:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:20:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:12,908 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:13,031 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-07 06:20:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:20:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-07 06:20:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:13,035 INFO L225 Difference]: With dead ends: 213 [2024-11-07 06:20:13,035 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 06:20:13,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:13,037 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 38 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:13,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 256 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:20:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 06:20:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2024-11-07 06:20:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 164 transitions. [2024-11-07 06:20:13,063 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 164 transitions. Word has length 192 [2024-11-07 06:20:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:13,069 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 164 transitions. [2024-11-07 06:20:13,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 164 transitions. [2024-11-07 06:20:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 06:20:13,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:13,075 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:20:13,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1549342859, now seen corresponding path program 1 times [2024-11-07 06:20:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390556878] [2024-11-07 06:20:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:20:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390556878] [2024-11-07 06:20:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390556878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:13,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:20:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509741659] [2024-11-07 06:20:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:13,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:20:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:20:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:13,422 INFO L87 Difference]: Start difference. First operand 108 states and 164 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:13,461 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2024-11-07 06:20:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:20:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-07 06:20:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:13,464 INFO L225 Difference]: With dead ends: 214 [2024-11-07 06:20:13,464 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 06:20:13,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:13,469 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:13,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:20:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 06:20:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 06:20:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-11-07 06:20:13,491 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 192 [2024-11-07 06:20:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-11-07 06:20:13,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-11-07 06:20:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 06:20:13,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:13,500 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:13,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:20:13,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:13,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -949185005, now seen corresponding path program 1 times [2024-11-07 06:20:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69109972] [2024-11-07 06:20:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:20:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:13,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69109972] [2024-11-07 06:20:13,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69109972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:13,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:13,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:20:13,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266333613] [2024-11-07 06:20:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:13,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:20:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:20:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:20:13,852 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:13,969 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2024-11-07 06:20:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:20:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-07 06:20:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:13,972 INFO L225 Difference]: With dead ends: 320 [2024-11-07 06:20:13,972 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 06:20:13,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:20:13,977 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 103 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:13,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 259 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:20:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 06:20:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-11-07 06:20:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:20:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 322 transitions. [2024-11-07 06:20:14,032 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 322 transitions. Word has length 193 [2024-11-07 06:20:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:14,032 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 322 transitions. [2024-11-07 06:20:14,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2024-11-07 06:20:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 06:20:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:14,037 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:14,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:20:14,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 695384867, now seen corresponding path program 1 times [2024-11-07 06:20:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:14,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093651354] [2024-11-07 06:20:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:20:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093651354] [2024-11-07 06:20:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093651354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 06:20:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460448904] [2024-11-07 06:20:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:20:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:20:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:20:15,528 INFO L87 Difference]: Start difference. First operand 212 states and 322 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:16,468 INFO L93 Difference]: Finished difference Result 648 states and 971 transitions. [2024-11-07 06:20:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:20:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-07 06:20:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:16,474 INFO L225 Difference]: With dead ends: 648 [2024-11-07 06:20:16,474 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 06:20:16,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:20:16,476 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 385 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:16,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 607 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 06:20:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 06:20:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 301. [2024-11-07 06:20:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 210 states have (on average 1.3571428571428572) internal successors, (285), 210 states have internal predecessors, (285), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-07 06:20:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 459 transitions. [2024-11-07 06:20:16,549 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 459 transitions. Word has length 194 [2024-11-07 06:20:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:16,551 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 459 transitions. [2024-11-07 06:20:16,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:20:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 459 transitions. [2024-11-07 06:20:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 06:20:16,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:16,556 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:16,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:20:16,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:16,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash -315732383, now seen corresponding path program 1 times [2024-11-07 06:20:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:16,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122615377] [2024-11-07 06:20:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:20:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:20:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:20:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:20:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:20:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:20:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:20:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:20:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:20:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:20:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:20:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:20:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:20:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:20:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:20:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:20:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:20:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:20:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:20:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:20:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:20:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:20:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:20:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:20:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:20:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:20:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:20:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 06:20:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 06:20:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:20:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:20:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122615377] [2024-11-07 06:20:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122615377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:20:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529959453] [2024-11-07 06:20:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:16,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:20:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:16,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:20:16,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:20:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:17,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:20:17,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:20:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-07 06:20:17,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:20:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:20:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529959453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:20:17,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:20:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:20:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205312561] [2024-11-07 06:20:17,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:20:17,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:20:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:20:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:20:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:20:17,657 INFO L87 Difference]: Start difference. First operand 301 states and 459 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 06:20:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:17,885 INFO L93 Difference]: Finished difference Result 537 states and 802 transitions. [2024-11-07 06:20:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:20:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 194 [2024-11-07 06:20:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:17,889 INFO L225 Difference]: With dead ends: 537 [2024-11-07 06:20:17,889 INFO L226 Difference]: Without dead ends: 325 [2024-11-07 06:20:17,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:20:17,891 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:17,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 260 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:20:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-07 06:20:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 313. [2024-11-07 06:20:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 219 states have internal predecessors, (291), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-07 06:20:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 465 transitions. [2024-11-07 06:20:17,935 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 465 transitions. Word has length 194 [2024-11-07 06:20:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:17,936 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 465 transitions. [2024-11-07 06:20:17,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 06:20:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 465 transitions. [2024-11-07 06:20:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 06:20:17,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:17,940 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:17,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:20:18,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:20:18,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:18,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1125079009, now seen corresponding path program 1 times [2024-11-07 06:20:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:20:18,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571185879] [2024-11-07 06:20:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:20:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:20:18,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184636266] [2024-11-07 06:20:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:20:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:18,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:20:18,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:20:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:20:18,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:20:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:20:18,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:20:18,640 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:20:18,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:20:18,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:20:18,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:20:18,846 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:20:18,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:20:19,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:20:19 BoogieIcfgContainer [2024-11-07 06:20:19,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:20:19,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:20:19,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:20:19,002 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:20:19,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:11" (3/4) ... [2024-11-07 06:20:19,005 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:20:19,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:20:19,008 INFO L158 Benchmark]: Toolchain (without parser) took 8674.62ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 91.3MB in the beginning and 152.2MB in the end (delta: -60.9MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-07 06:20:19,008 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:20:19,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.84ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:20:19,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.00ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 70.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:20:19,011 INFO L158 Benchmark]: Boogie Preprocessor took 100.22ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 64.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:20:19,012 INFO L158 Benchmark]: RCFGBuilder took 768.59ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 82.0MB in the end (delta: -17.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-07 06:20:19,012 INFO L158 Benchmark]: TraceAbstraction took 7413.21ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 81.3MB in the beginning and 152.2MB in the end (delta: -70.9MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-11-07 06:20:19,012 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 218.1MB. Free memory was 152.2MB in the beginning and 152.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:20:19,014 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.25ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.84ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.00ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 70.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 100.22ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 64.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 768.59ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 82.0MB in the end (delta: -17.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7413.21ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 81.3MB in the beginning and 152.2MB in the end (delta: -70.9MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 218.1MB. Free memory was 152.2MB in the beginning and 152.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned char var_1_22 = 0; [L42] unsigned char var_1_25 = 1; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_28 = 0; [L45] double var_1_29 = 50.2; [L46] signed char var_1_32 = -25; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] signed short int var_1_38 = -4; [L50] float var_1_40 = 16.2; [L51] float var_1_41 = 10.75; [L52] float var_1_42 = 999.6; [L53] float var_1_43 = 64.5; [L54] signed long int var_1_44 = -2; [L55] signed short int var_1_45 = 2; [L56] unsigned char last_1_var_1_8 = 5; [L57] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_2 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L148] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L150] var_1_3 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L151] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L154] var_1_5 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L156] var_1_6 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L158] var_1_7 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L159] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L160] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L160] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L161] var_1_9 = __VERIFIER_nondet_double() [L162] 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, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L162] 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, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L170] var_1_15 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L171] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L173] var_1_16 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L174] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L176] var_1_17 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L177] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L183] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L188] var_1_41 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L189] RET assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L190] var_1_42 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L191] RET assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L192] var_1_43 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L193] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L208] RET updateVariables() [L209] CALL step() [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L70] EXPR var_1_10 >> var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L70] COND TRUE ((var_1_10 | 1) % var_1_15) >= (var_1_10 >> var_1_16) [L71] var_1_38 = (((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) < 0 ) ? -((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) : ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L73] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L74] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L75] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L83] var_1_20 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L84] COND TRUE var_1_2 || (2.65f > var_1_4) [L85] var_1_22 = (! (! var_1_25)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L87] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L90] COND FALSE !(\read(var_1_2)) [L99] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L101] COND TRUE (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) - ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) <= var_1_15 [L102] var_1_32 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L104] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L107] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L108] COND FALSE !(var_1_10 == stepLocal_1) [L111] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L113] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L116] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L119] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L122] EXPR var_1_16 & var_1_8 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L122] COND FALSE !((var_1_16 & var_1_8) <= ((var_1_15 - var_1_15) + -16)) [L125] COND FALSE !(\read(var_1_28)) [L128] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L131] var_1_45 = var_1_12 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L132] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L135] COND FALSE !(last_1_var_1_18 != var_1_16) [L142] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 625 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1794 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1013 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 781 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 169 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1739 NumberOfCodeBlocks, 1739 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 3186 SizeOfPredicates, 1 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12947/12992 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 06:20:19,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.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 d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:20:21,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:20:21,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:20:21,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:20:21,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:20:21,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:20:21,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:20:21,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:20:21,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:20:21,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:20:21,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:20:21,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:20:21,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:20:21,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:20:21,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:20:21,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:20:21,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:20:21,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:20:21,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:20:21,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:20:21,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:21,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:20:21,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:20:21,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:20:21,698 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:20:21,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:20:21,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:20:21,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:20:21,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:20:21,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:20:21,699 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 -> d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead [2024-11-07 06:20:22,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:20:22,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:20:22,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:20:22,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:20:22,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:20:22,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:23,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:20:24,037 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:20:24,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:24,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0b7bb39b/96385b7c733a4e9582e55bbc952094d0/FLAGe7aafa74e [2024-11-07 06:20:24,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0b7bb39b/96385b7c733a4e9582e55bbc952094d0 [2024-11-07 06:20:24,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:20:24,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:20:24,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:24,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:20:24,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:20:24,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b06ed45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24, skipping insertion in model container [2024-11-07 06:20:24,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:20:24,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-07 06:20:24,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:24,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:20:24,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-07 06:20:24,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:20:24,514 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:20:24,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24 WrapperNode [2024-11-07 06:20:24,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:20:24,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:24,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:20:24,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:20:24,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,588 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-07 06:20:24,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:20:24,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:20:24,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:20:24,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:20:24,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,629 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 06:20:24,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:20:24,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:20:24,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:20:24,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:20:24,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (1/1) ... [2024-11-07 06:20:24,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:20:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:20:24,708 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 06:20:24,715 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 06:20:24,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:20:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:20:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:20:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:20:24,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:20:24,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:20:24,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:20:24,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:20:53,114 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:20:53,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:20:53,127 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:20:53,127 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:20:53,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:53 BoogieIcfgContainer [2024-11-07 06:20:53,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:20:53,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:20:53,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:20:53,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:20:53,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:20:24" (1/3) ... [2024-11-07 06:20:53,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754faf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:53, skipping insertion in model container [2024-11-07 06:20:53,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:20:24" (2/3) ... [2024-11-07 06:20:53,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754faf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:20:53, skipping insertion in model container [2024-11-07 06:20:53,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:20:53" (3/3) ... [2024-11-07 06:20:53,138 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-07 06:20:53,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:20:53,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:20:53,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:20:53,225 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;@7a8bff2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:20:53,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:20:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 06:20:53,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:53,249 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:53,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 89355840, now seen corresponding path program 1 times [2024-11-07 06:20:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:20:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572926995] [2024-11-07 06:20:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:53,270 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 06:20:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:20:53,273 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 06:20:53,277 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 06:20:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:55,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:20:55,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:20:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2024-11-07 06:20:55,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:20:55,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:20:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572926995] [2024-11-07 06:20:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572926995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:20:55,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:20:55,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:20:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582149186] [2024-11-07 06:20:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:20:55,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:20:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:20:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:20:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:20:55,458 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:20:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:55,499 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2024-11-07 06:20:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:20:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-07 06:20:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:55,508 INFO L225 Difference]: With dead ends: 174 [2024-11-07 06:20:55,508 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 06:20:55,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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 06:20:55,515 INFO L432 NwaCegarLoop]: 131 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, 131 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 06:20:55,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:20:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 06:20:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 06:20:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:20:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-07 06:20:55,568 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 190 [2024-11-07 06:20:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-07 06:20:55,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:20:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-07 06:20:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:20:55,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:55,574 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:55,614 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 06:20:55,775 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 06:20:55,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 905288289, now seen corresponding path program 1 times [2024-11-07 06:20:55,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:20:55,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418518847] [2024-11-07 06:20:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:55,778 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 06:20:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:20:55,781 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 06:20:55,782 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 06:20:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:57,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:20:57,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:20:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-07 06:20:59,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:21:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:21:03,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:21:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418518847] [2024-11-07 06:21:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418518847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:21:03,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:21:03,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:21:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132151082] [2024-11-07 06:21:03,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:21:03,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:21:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:21:03,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:21:03,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:21:03,917 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:21:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:21:08,569 INFO L93 Difference]: Finished difference Result 177 states and 266 transitions. [2024-11-07 06:21:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:21:08,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 191 [2024-11-07 06:21:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:21:08,573 INFO L225 Difference]: With dead ends: 177 [2024-11-07 06:21:08,573 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 06:21:08,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:21:08,574 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:21:08,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 230 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 06:21:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 06:21:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-07 06:21:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:21:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2024-11-07 06:21:08,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 191 [2024-11-07 06:21:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:21:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2024-11-07 06:21:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:21:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2024-11-07 06:21:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:21:08,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:21:08,608 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:08,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:21:08,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:21:08,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:21:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:21:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash -683059613, now seen corresponding path program 1 times [2024-11-07 06:21:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:21:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186484588] [2024-11-07 06:21:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:21:08,810 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 06:21:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:21:08,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:21:08,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:21:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:21:10,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:21:10,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:21:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:21:11,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:21:11,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:21:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186484588] [2024-11-07 06:21:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186484588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:21:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:21:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:21:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214225585] [2024-11-07 06:21:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:21:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:21:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:21:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:21:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:21:11,297 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:21:16,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:21:20,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:21:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:21:20,506 INFO L93 Difference]: Finished difference Result 206 states and 306 transitions. [2024-11-07 06:21:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:21:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 06:21:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:21:20,511 INFO L225 Difference]: With dead ends: 206 [2024-11-07 06:21:20,511 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 06:21:20,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:21:20,512 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 27 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:21:20,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-07 06:21:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 06:21:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2024-11-07 06:21:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:21:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-07 06:21:20,537 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 191 [2024-11-07 06:21:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:21:20,538 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-07 06:21:20,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:21:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-07 06:21:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:21:20,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:21:20,542 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:20,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:21:20,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:21:20,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:21:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:21:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1386139295, now seen corresponding path program 1 times [2024-11-07 06:21:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:21:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481148485] [2024-11-07 06:21:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:21:20,744 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 06:21:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:21:20,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:21:20,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:21:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:21:22,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:21:22,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:21:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-07 06:21:25,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:21:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:21:30,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:21:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481148485] [2024-11-07 06:21:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481148485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:21:30,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:21:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:21:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845021646] [2024-11-07 06:21:30,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:21:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:21:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:21:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:21:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:21:30,844 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 06:21:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:21:35,752 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2024-11-07 06:21:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:21:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 191 [2024-11-07 06:21:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:21:35,755 INFO L225 Difference]: With dead ends: 217 [2024-11-07 06:21:35,755 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 06:21:35,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:21:35,760 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:21:35,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 229 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 06:21:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 06:21:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2024-11-07 06:21:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:21:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-07 06:21:35,783 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 191 [2024-11-07 06:21:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:21:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-07 06:21:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 06:21:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-07 06:21:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:21:35,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:21:35,789 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:35,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:21:35,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:21:35,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:21:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:21:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash 388868067, now seen corresponding path program 1 times [2024-11-07 06:21:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:21:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648171992] [2024-11-07 06:21:35,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:21:35,993 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 06:21:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:21:35,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:21:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:21:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:21:37,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:21:37,877 INFO L278 TraceCheckSpWp]: Computing forward predicates...