./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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', 'f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:44:21,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:44:21,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:44:21,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:44:21,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:44:21,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:44:21,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:44:21,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:44:21,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:44:21,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:44:21,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:44:21,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:44:21,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:44:21,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:44:21,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:44:21,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:44:21,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:44:21,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:44:21,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:44:21,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:44:21,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:44:21,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:44:21,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:44:21,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:44:21,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:44:21,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:44:21,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:44:21,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:44:21,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:44:21,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:44:21,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:44:21,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:44:21,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:44:21,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:44:21,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:44:21,889 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-07 05:44:22,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:44:22,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:44:22,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:44:22,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:44:22,204 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:44:22,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:23,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:44:23,807 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:44:23,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:23,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dcaa03e0/67ff1297a5504e14a2d10105e80e1d05/FLAGa358e52c3 [2024-11-07 05:44:23,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dcaa03e0/67ff1297a5504e14a2d10105e80e1d05 [2024-11-07 05:44:23,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:44:23,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:44:23,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:23,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:44:23,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:44:23,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:23" (1/1) ... [2024-11-07 05:44:23,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16739f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:23, skipping insertion in model container [2024-11-07 05:44:23,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:23" (1/1) ... [2024-11-07 05:44:23,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:44:23,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-07 05:44:24,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:24,043 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:44:24,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-07 05:44:24,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:24,103 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:44:24,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24 WrapperNode [2024-11-07 05:44:24,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:24,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:24,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:44:24,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:44:24,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,167 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-07 05:44:24,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:24,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:44:24,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:44:24,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:44:24,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:44:24,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:44:24,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:44:24,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:44:24,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:44:24,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (1/1) ... [2024-11-07 05:44:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:44:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:24,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:44:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:44:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:44:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:44:24,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:44:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:44:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:44:24,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:44:24,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:44:24,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:44:24,774 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:44:24,776 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:44:24,800 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:44:24,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:44:24,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:24 BoogieIcfgContainer [2024-11-07 05:44:24,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:44:24,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:44:24,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:44:24,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:44:24,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:44:23" (1/3) ... [2024-11-07 05:44:24,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dc0f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:24, skipping insertion in model container [2024-11-07 05:44:24,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:24" (2/3) ... [2024-11-07 05:44:24,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70dc0f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:24, skipping insertion in model container [2024-11-07 05:44:24,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:24" (3/3) ... [2024-11-07 05:44:24,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:24,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:44:24,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:44:24,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:44:24,895 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;@4c695dfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:44:24,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:44:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:44:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:44:24,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:24,917 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:24,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 174731053, now seen corresponding path program 1 times [2024-11-07 05:44:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965634488] [2024-11-07 05:44:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:44:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:44:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:44:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:44:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:44:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:44:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:44:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:44:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:44:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:44:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:44:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:44:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:44:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:44:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:44:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:44:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:44:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:44:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:44:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:44:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:44:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:44:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:44:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:44:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:44:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:44:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:44:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965634488] [2024-11-07 05:44:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965634488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:44:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534892556] [2024-11-07 05:44:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:25,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:44:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:25,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:44:25,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:44:25,435 INFO L87 Difference]: Start difference. First operand has 91 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:44:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:25,466 INFO L93 Difference]: Finished difference Result 175 states and 304 transitions. [2024-11-07 05:44:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:44:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-07 05:44:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:25,474 INFO L225 Difference]: With dead ends: 175 [2024-11-07 05:44:25,474 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 05:44:25,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:44:25,479 INFO L432 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:25,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:44:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 05:44:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 05:44:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:44:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-07 05:44:25,525 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 172 [2024-11-07 05:44:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:25,525 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-07 05:44:25,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:44:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-07 05:44:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:44:25,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:25,529 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:44:25,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 246179513, now seen corresponding path program 1 times [2024-11-07 05:44:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919355674] [2024-11-07 05:44:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:44:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:44:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:44:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:44:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:44:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:44:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:44:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:44:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:44:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:44:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:44:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:44:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:44:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:44:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:44:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:44:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:44:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:44:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:44:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:44:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:44:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:44:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:44:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:44:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:44:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:44:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:44:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919355674] [2024-11-07 05:44:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919355674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:26,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:44:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854977182] [2024-11-07 05:44:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:26,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:44:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:44:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:44:26,278 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:26,385 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2024-11-07 05:44:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:44:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-07 05:44:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:26,390 INFO L225 Difference]: With dead ends: 255 [2024-11-07 05:44:26,391 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 05:44:26,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:44:26,393 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 78 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:26,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 374 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:44:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 05:44:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-11-07 05:44:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 112 states have internal predecessors, (152), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:44:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2024-11-07 05:44:26,430 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 172 [2024-11-07 05:44:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2024-11-07 05:44:26,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2024-11-07 05:44:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 05:44:26,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:26,437 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:44:26,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash -219057617, now seen corresponding path program 1 times [2024-11-07 05:44:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377792262] [2024-11-07 05:44:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:44:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:44:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:44:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:44:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:44:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:44:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:44:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:44:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:44:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:44:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:44:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:44:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:44:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:44:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:44:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:44:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:44:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:44:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:44:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:44:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:44:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:44:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:44:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:44:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:44:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:44:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:44:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377792262] [2024-11-07 05:44:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377792262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:27,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:44:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307956503] [2024-11-07 05:44:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:27,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:44:27,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:44:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:44:27,134 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:27,508 INFO L93 Difference]: Finished difference Result 441 states and 672 transitions. [2024-11-07 05:44:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:44:27,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 05:44:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:27,512 INFO L225 Difference]: With dead ends: 441 [2024-11-07 05:44:27,512 INFO L226 Difference]: Without dead ends: 277 [2024-11-07 05:44:27,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:44:27,521 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 131 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:27,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 527 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:44:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-07 05:44:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2024-11-07 05:44:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 200 states have (on average 1.38) internal successors, (276), 202 states have internal predecessors, (276), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 05:44:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 412 transitions. [2024-11-07 05:44:27,587 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 412 transitions. Word has length 173 [2024-11-07 05:44:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 412 transitions. [2024-11-07 05:44:27,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 412 transitions. [2024-11-07 05:44:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 05:44:27,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:27,594 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:27,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:44:27,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:27,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -353071123, now seen corresponding path program 1 times [2024-11-07 05:44:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76114982] [2024-11-07 05:44:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:44:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:44:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:44:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:44:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:44:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:44:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:44:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:44:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:44:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:44:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:44:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:44:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:44:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:44:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:44:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:44:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:44:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:44:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:44:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:44:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:44:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:44:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:44:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:44:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:44:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:44:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:44:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76114982] [2024-11-07 05:44:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76114982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:44:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122072073] [2024-11-07 05:44:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:44:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:44:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:44:28,054 INFO L87 Difference]: Start difference. First operand 273 states and 412 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:28,366 INFO L93 Difference]: Finished difference Result 811 states and 1227 transitions. [2024-11-07 05:44:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:44:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 05:44:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:28,372 INFO L225 Difference]: With dead ends: 811 [2024-11-07 05:44:28,373 INFO L226 Difference]: Without dead ends: 541 [2024-11-07 05:44:28,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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 05:44:28,375 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:28,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 371 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:44:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-07 05:44:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 535. [2024-11-07 05:44:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 390 states have (on average 1.3794871794871795) internal successors, (538), 394 states have internal predecessors, (538), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-07 05:44:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 810 transitions. [2024-11-07 05:44:28,478 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 810 transitions. Word has length 173 [2024-11-07 05:44:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:28,478 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 810 transitions. [2024-11-07 05:44:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 810 transitions. [2024-11-07 05:44:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:44:28,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:28,481 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:44:28,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -326008827, now seen corresponding path program 1 times [2024-11-07 05:44:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770897356] [2024-11-07 05:44:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:44:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646633326] [2024-11-07 05:44:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:28,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:28,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:44:28,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 05:44:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:28,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 05:44:28,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 333 proven. 9 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-11-07 05:44:29,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:44:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770897356] [2024-11-07 05:44:30,112 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:44:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646633326] [2024-11-07 05:44:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646633326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:44:30,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:44:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 05:44:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730928058] [2024-11-07 05:44:30,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:30,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 05:44:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 05:44:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:44:30,116 INFO L87 Difference]: Start difference. First operand 535 states and 810 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 05:44:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:35,582 INFO L93 Difference]: Finished difference Result 1457 states and 2139 transitions. [2024-11-07 05:44:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 05:44:35,583 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 174 [2024-11-07 05:44:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:35,592 INFO L225 Difference]: With dead ends: 1457 [2024-11-07 05:44:35,593 INFO L226 Difference]: Without dead ends: 925 [2024-11-07 05:44:35,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=368, Invalid=754, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 05:44:35,597 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 581 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:35,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 503 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 05:44:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-07 05:44:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 755. [2024-11-07 05:44:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 570 states have (on average 1.3649122807017544) internal successors, (778), 578 states have internal predecessors, (778), 168 states have call successors, (168), 16 states have call predecessors, (168), 16 states have return successors, (168), 160 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-07 05:44:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1114 transitions. [2024-11-07 05:44:35,689 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1114 transitions. Word has length 174 [2024-11-07 05:44:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:35,690 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1114 transitions. [2024-11-07 05:44:35,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 05:44:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1114 transitions. [2024-11-07 05:44:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:44:35,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:35,693 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:35,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 05:44:35,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:35,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash 240587453, now seen corresponding path program 1 times [2024-11-07 05:44:35,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92794382] [2024-11-07 05:44:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:44:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:44:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:44:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:44:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:44:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:44:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:44:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 05:44:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 05:44:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:44:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:44:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 05:44:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 05:44:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:44:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:44:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:44:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:44:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:44:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:44:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:44:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:44:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:44:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:44:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:44:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:44:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 05:44:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:44:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92794382] [2024-11-07 05:44:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92794382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667690545] [2024-11-07 05:44:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:36,237 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 05:44:36,239 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 05:44:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:36,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:44:36,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-07 05:44:36,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:44:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667690545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:44:36,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:44:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 05:44:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304351137] [2024-11-07 05:44:36,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:44:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:44:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:44:36,716 INFO L87 Difference]: Start difference. First operand 755 states and 1114 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:44:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:36,967 INFO L93 Difference]: Finished difference Result 1555 states and 2269 transitions. [2024-11-07 05:44:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:44:36,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 174 [2024-11-07 05:44:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:36,975 INFO L225 Difference]: With dead ends: 1555 [2024-11-07 05:44:36,975 INFO L226 Difference]: Without dead ends: 803 [2024-11-07 05:44:36,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:44:36,979 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 129 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 244 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:44:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-07 05:44:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 771. [2024-11-07 05:44:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 582 states have (on average 1.3402061855670102) internal successors, (780), 590 states have internal predecessors, (780), 168 states have call successors, (168), 20 states have call predecessors, (168), 20 states have return successors, (168), 160 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-07 05:44:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1116 transitions. [2024-11-07 05:44:37,067 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1116 transitions. Word has length 174 [2024-11-07 05:44:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:37,067 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1116 transitions. [2024-11-07 05:44:37,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:44:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1116 transitions. [2024-11-07 05:44:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 05:44:37,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:37,070 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:37,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 05:44:37,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:37,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1512402032, now seen corresponding path program 1 times [2024-11-07 05:44:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228372218] [2024-11-07 05:44:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:44:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633148439] [2024-11-07 05:44:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:37,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:37,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:44:37,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:44:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:37,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 05:44:37,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-07 05:44:38,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:44:39,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228372218] [2024-11-07 05:44:39,109 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:44:39,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633148439] [2024-11-07 05:44:39,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633148439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:39,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:44:39,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-07 05:44:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050101929] [2024-11-07 05:44:39,109 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 05:44:39,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:44:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:44:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:44:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=214, Unknown=5, NotChecked=0, Total=306 [2024-11-07 05:44:39,110 INFO L87 Difference]: Start difference. First operand 771 states and 1116 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:44:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:40,201 INFO L93 Difference]: Finished difference Result 1583 states and 2224 transitions. [2024-11-07 05:44:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 05:44:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 174 [2024-11-07 05:44:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:40,208 INFO L225 Difference]: With dead ends: 1583 [2024-11-07 05:44:40,208 INFO L226 Difference]: Without dead ends: 815 [2024-11-07 05:44:40,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=314, Invalid=673, Unknown=5, NotChecked=0, Total=992 [2024-11-07 05:44:40,212 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 301 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:40,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 734 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 05:44:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-07 05:44:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 543. [2024-11-07 05:44:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 414 states have (on average 1.328502415458937) internal successors, (550), 414 states have internal predecessors, (550), 104 states have call successors, (104), 24 states have call predecessors, (104), 24 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-07 05:44:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 758 transitions. [2024-11-07 05:44:40,287 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 758 transitions. Word has length 174 [2024-11-07 05:44:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:40,289 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 758 transitions. [2024-11-07 05:44:40,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:44:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 758 transitions. [2024-11-07 05:44:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:44:40,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:40,292 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:40,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:44:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:40,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -913663408, now seen corresponding path program 1 times [2024-11-07 05:44:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:44:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702138115] [2024-11-07 05:44:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:44:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:44:40,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666011029] [2024-11-07 05:44:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:44:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:40,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:44:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 05:44:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:44:40,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:44:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:44:40,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:44:40,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:44:40,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:44:40,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 05:44:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 05:44:41,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:41,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:44:41,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:44:41 BoogieIcfgContainer [2024-11-07 05:44:41,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:44:41,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:44:41,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:44:41,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:44:41,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:24" (3/4) ... [2024-11-07 05:44:41,255 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:44:41,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:44:41,256 INFO L158 Benchmark]: Toolchain (without parser) took 17424.37ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 91.7MB in the beginning and 80.3MB in the end (delta: 11.4MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2024-11-07 05:44:41,256 INFO L158 Benchmark]: CDTParser took 0.86ms. 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 05:44:41,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.30ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:44:41,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.29ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:44:41,257 INFO L158 Benchmark]: Boogie Preprocessor took 64.82ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 69.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:44:41,257 INFO L158 Benchmark]: RCFGBuilder took 566.28ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 90.4MB in the end (delta: -21.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-07 05:44:41,257 INFO L158 Benchmark]: TraceAbstraction took 16447.69ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 89.9MB in the beginning and 80.4MB in the end (delta: 9.5MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2024-11-07 05:44:41,258 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 243.3MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:44:41,260 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.86ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.30ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.29ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.82ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 69.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 566.28ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 90.4MB in the end (delta: -21.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16447.69ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 89.9MB in the beginning and 80.4MB in the end (delta: 9.5MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 243.3MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=32, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_20 = var_1_11 [L59] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L60] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L60] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L61] COND TRUE var_1_12 != var_1_21 [L62] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L67] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L78] unsigned char stepLocal_1 = var_1_14; [L79] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L81] COND TRUE stepLocal_1 || var_1_14 [L82] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=1] [L89] COND FALSE !(var_1_6 > (- var_1_7)) [L94] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L96] var_1_22 = var_1_8 [L97] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L98] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L103] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L104] COND TRUE var_1_11 >= var_1_11 [L105] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L107] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L108] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L109] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L110] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=10, var_1_47=0, var_1_8=0] [L127] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L128] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=-8589934592, var_1_47=0, var_1_8=0] [L130] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=-8589934592, var_1_47=-8589934592, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=-8589934592, var_1_47=-8589934592, var_1_8=0] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=-8589934592, var_1_47=-8589934592, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-8589934592, var_1_12=-8589934592, var_1_14=1, var_1_15=-255, var_1_16=-255, var_1_17=1, var_1_19=0, var_1_20=-8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=-255, var_1_31=-8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=-255, var_1_43=-8589934592, var_1_47=-8589934592, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1447 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1373 mSDsluCounter, 2886 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1906 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925 IncrementalHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 980 mSDtfsCounter, 1925 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1257 GetRequests, 1176 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred in iteration=6, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 488 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2084 NumberOfCodeBlocks, 2084 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1724 ConstructedInterpolants, 0 QuantifiedInterpolants, 4456 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 12847/13000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 05:44:41,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:44:43,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:44:43,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:44:43,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:44:43,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:44:43,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:44:43,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:44:43,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:44:43,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:44:43,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:44:43,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:44:43,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:44:43,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:44:43,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:44:43,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:44:43,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:44:43,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:44:43,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:44:43,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:44:43,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:44:43,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:44:43,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:44:43,943 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-07 05:44:44,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:44:44,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:44:44,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:44:44,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:44:44,270 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:44:44,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:45,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:44:45,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:44:45,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:45,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b68132e0/59f45a05acf5465c988c5ea9516cc3b3/FLAGeccd495b7 [2024-11-07 05:44:45,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b68132e0/59f45a05acf5465c988c5ea9516cc3b3 [2024-11-07 05:44:45,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:44:45,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:44:45,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:45,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:44:45,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:44:45,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:45" (1/1) ... [2024-11-07 05:44:45,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddd8591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:45, skipping insertion in model container [2024-11-07 05:44:45,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:45" (1/1) ... [2024-11-07 05:44:45,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:44:46,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-07 05:44:46,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:46,178 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:44:46,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i[919,932] [2024-11-07 05:44:46,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:44:46,265 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:44:46,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46 WrapperNode [2024-11-07 05:44:46,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:44:46,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:46,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:44:46,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:44:46,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,331 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-07 05:44:46,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:44:46,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:44:46,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:44:46,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:44:46,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:44:46,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:44:46,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:44:46,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:44:46,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:44:46,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (1/1) ... [2024-11-07 05:44:46,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:44:46,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:44:46,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:44:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:44:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:44:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:44:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:44:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:44:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:44:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:44:46,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:44:46,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:44:53,625 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 05:44:53,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:44:53,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:44:53,636 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:44:53,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:53 BoogieIcfgContainer [2024-11-07 05:44:53,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:44:53,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:44:53,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:44:53,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:44:53,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:44:45" (1/3) ... [2024-11-07 05:44:53,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d06161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:53, skipping insertion in model container [2024-11-07 05:44:53,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:46" (2/3) ... [2024-11-07 05:44:53,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d06161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:53, skipping insertion in model container [2024-11-07 05:44:53,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:53" (3/3) ... [2024-11-07 05:44:53,650 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-07 05:44:53,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:44:53,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:44:53,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:44:53,726 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;@1017ac99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:44:53,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:44:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:44:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 05:44:53,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:53,748 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:53,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1183784408, now seen corresponding path program 1 times [2024-11-07 05:44:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999430251] [2024-11-07 05:44:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:53,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:44:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:53,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:44:53,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 05:44:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:54,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:44:54,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-07 05:44:54,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:44:54,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999430251] [2024-11-07 05:44:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999430251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:44:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:44:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:44:54,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023833423] [2024-11-07 05:44:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:54,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:44:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:44:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:44:54,316 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:44:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:54,350 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-11-07 05:44:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:44:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-07 05:44:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:44:54,359 INFO L225 Difference]: With dead ends: 161 [2024-11-07 05:44:54,360 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 05:44:54,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:44:54,369 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:44:54,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:44:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 05:44:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 05:44:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:44:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-07 05:44:54,421 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 169 [2024-11-07 05:44:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:44:54,423 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-07 05:44:54,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 05:44:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-07 05:44:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 05:44:54,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:44:54,429 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:44:54,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 05:44:54,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:44:54,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:44:54,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:44:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1397158348, now seen corresponding path program 1 times [2024-11-07 05:44:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:44:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308930852] [2024-11-07 05:44:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:44:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:44:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:44:54,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:44:54,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 05:44:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:44:55,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:44:55,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:44:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-07 05:44:56,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:44:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:44:56,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:44:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308930852] [2024-11-07 05:44:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308930852] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 05:44:56,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:44:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 05:44:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092591795] [2024-11-07 05:44:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:44:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:44:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:44:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:44:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:44:56,760 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:44:59,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:44:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:44:59,996 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2024-11-07 05:45:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:45:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-07 05:45:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:45:00,030 INFO L225 Difference]: With dead ends: 161 [2024-11-07 05:45:00,030 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 05:45:00,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:45:00,032 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 72 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:45:00,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 148 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 05:45:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 05:45:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 05:45:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 05:45:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-07 05:45:00,044 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 169 [2024-11-07 05:45:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:45:00,045 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-07 05:45:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:45:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-07 05:45:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 05:45:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:45:00,051 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:45:00,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:45:00,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:00,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:45:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:45:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1482391893, now seen corresponding path program 1 times [2024-11-07 05:45:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:45:00,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32823729] [2024-11-07 05:45:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:45:00,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:45:00,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 05:45:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:00,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:45:00,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 05:45:02,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:45:02,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:45:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32823729] [2024-11-07 05:45:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32823729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:45:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:45:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:45:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851462472] [2024-11-07 05:45:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:45:02,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:45:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:45:02,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:45:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:45:02,202 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:45:05,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:45:05,427 INFO L93 Difference]: Finished difference Result 246 states and 366 transitions. [2024-11-07 05:45:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:45:05,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-07 05:45:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:45:05,469 INFO L225 Difference]: With dead ends: 246 [2024-11-07 05:45:05,469 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 05:45:05,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:45:05,471 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:45:05,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 341 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 05:45:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 05:45:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2024-11-07 05:45:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:45:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2024-11-07 05:45:05,493 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 170 [2024-11-07 05:45:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:45:05,494 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2024-11-07 05:45:05,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 05:45:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2024-11-07 05:45:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 05:45:05,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:45:05,497 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:45:05,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 05:45:05,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:05,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:45:05,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:45:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1248506696, now seen corresponding path program 1 times [2024-11-07 05:45:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:45:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961636950] [2024-11-07 05:45:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:45:05,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:45:05,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 05:45:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:06,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:45:06,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-07 05:45:07,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:45:08,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:45:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961636950] [2024-11-07 05:45:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961636950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:45:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939135210] [2024-11-07 05:45:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:45:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:45:08,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:45:08,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 05:45:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:09,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 05:45:09,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-07 05:45:10,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:45:11,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1939135210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:45:11,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:45:11,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-07 05:45:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841283382] [2024-11-07 05:45:11,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:45:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:45:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:45:11,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:45:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:45:11,341 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:45:17,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:20,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:45:21,001 INFO L93 Difference]: Finished difference Result 349 states and 497 transitions. [2024-11-07 05:45:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 05:45:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 171 [2024-11-07 05:45:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:45:21,033 INFO L225 Difference]: With dead ends: 349 [2024-11-07 05:45:21,034 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 05:45:21,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-07 05:45:21,035 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 52 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:45:21,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 187 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2024-11-07 05:45:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 05:45:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2024-11-07 05:45:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 114 states have internal predecessors, (140), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:45:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 244 transitions. [2024-11-07 05:45:21,061 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 244 transitions. Word has length 171 [2024-11-07 05:45:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:45:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 244 transitions. [2024-11-07 05:45:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 05:45:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 244 transitions. [2024-11-07 05:45:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 05:45:21,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:45:21,064 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:45:21,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-07 05:45:21,278 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 (5)] Ended with exit code 0 [2024-11-07 05:45:21,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:21,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:45:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:45:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 714091888, now seen corresponding path program 1 times [2024-11-07 05:45:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:45:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145906738] [2024-11-07 05:45:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:21,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:21,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:45:21,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:45:21,489 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 (7)] Waiting until timeout for monitored process [2024-11-07 05:45:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:21,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 05:45:21,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-07 05:45:22,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:45:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 05:45:23,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:45:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145906738] [2024-11-07 05:45:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145906738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:45:23,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:45:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 05:45:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238146067] [2024-11-07 05:45:23,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:45:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:45:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:45:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:45:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:45:23,578 INFO L87 Difference]: Start difference. First operand 175 states and 244 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:45:28,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:45:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:45:28,682 INFO L93 Difference]: Finished difference Result 371 states and 507 transitions. [2024-11-07 05:45:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:45:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 171 [2024-11-07 05:45:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:45:28,732 INFO L225 Difference]: With dead ends: 371 [2024-11-07 05:45:28,732 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 05:45:28,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:45:28,734 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 101 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:45:28,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 205 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-11-07 05:45:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 05:45:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2024-11-07 05:45:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 120 states have (on average 1.2) internal successors, (144), 120 states have internal predecessors, (144), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:45:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2024-11-07 05:45:28,764 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 171 [2024-11-07 05:45:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:45:28,767 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2024-11-07 05:45:28,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:45:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2024-11-07 05:45:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 05:45:28,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:45:28,770 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:45:28,790 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 (7)] Ended with exit code 0 [2024-11-07 05:45:28,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:28,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:45:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:45:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 526937976, now seen corresponding path program 1 times [2024-11-07 05:45:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:45:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159092682] [2024-11-07 05:45:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:28,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:45:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:45:28,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:45:28,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 05:45:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:29,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 05:45:29,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:45:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 46 proven. 576 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-07 05:45:34,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:45:35,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:45:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159092682] [2024-11-07 05:45:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159092682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:45:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1748335567] [2024-11-07 05:45:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:45:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:45:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:45:35,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:45:35,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-07 05:45:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:45:36,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 05:45:36,445 INFO L278 TraceCheckSpWp]: Computing forward predicates...