./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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_fillercodesize_ps-cn-25_file-40.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', '83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3'] 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_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:15:40,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:15:40,162 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:15:40,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:15:40,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:15:40,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:15:40,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:15:40,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:15:40,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:15:40,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:15:40,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:15:40,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:15:40,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:15:40,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:15:40,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:15:40,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:15:40,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:15:40,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:15:40,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:15:40,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:15:40,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:15:40,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:15:40,207 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-11-07 05:15:40,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:15:40,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:15:40,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:15:40,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:15:40,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:15:40,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:41,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:15:42,076 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:15:42,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:42,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2ae62a40/f2c590db14d849bca9f8efbc4e1a46b2/FLAGa9b98cb55 [2024-11-07 05:15:42,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2ae62a40/f2c590db14d849bca9f8efbc4e1a46b2 [2024-11-07 05:15:42,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:15:42,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:15:42,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:15:42,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:15:42,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:15:42,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c1f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42, skipping insertion in model container [2024-11-07 05:15:42,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:15:42,524 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_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-07 05:15:42,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:15:42,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:15:42,612 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_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-07 05:15:42,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:15:42,666 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:15:42,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42 WrapperNode [2024-11-07 05:15:42,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:15:42,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:15:42,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:15:42,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:15:42,675 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:15:42" (1/1) ... [2024-11-07 05:15:42,684 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:15:42" (1/1) ... [2024-11-07 05:15:42,735 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-07 05:15:42,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:15:42,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:15:42,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:15:42,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:15:42,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,779 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:15:42,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:15:42,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:15:42,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:15:42,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:15:42,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (1/1) ... [2024-11-07 05:15:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:15:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:15:42,846 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:15:42,854 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:15:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:15:42,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:15:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:15:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:15:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:15:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:15:42,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:15:42,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:15:43,332 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:15:43,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:15:43,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:15:43,347 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:15:43,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:43 BoogieIcfgContainer [2024-11-07 05:15:43,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:15:43,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:15:43,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:15:43,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:15:43,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:15:42" (1/3) ... [2024-11-07 05:15:43,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c97601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:43, skipping insertion in model container [2024-11-07 05:15:43,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:42" (2/3) ... [2024-11-07 05:15:43,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c97601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:43, skipping insertion in model container [2024-11-07 05:15:43,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:43" (3/3) ... [2024-11-07 05:15:43,359 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:43,376 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:15:43,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:15:43,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:15:43,451 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;@70894d01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:15:43,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:15:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:15:43,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:43,471 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:43,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:43,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -147971958, now seen corresponding path program 1 times [2024-11-07 05:15:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:15:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400754888] [2024-11-07 05:15:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:15:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:15:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:15:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:15:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:15:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:15:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:15:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:15:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:15:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:15:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:15:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:15:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:15:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:15:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:15:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:15:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:15:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:15:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:15:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:15:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:15:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:15:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:15:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:15:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 05:15:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:15:43,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400754888] [2024-11-07 05:15:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400754888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:15:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596781538] [2024-11-07 05:15:43,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:43,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:15:43,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:15:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:15:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:15:43,996 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 05:15:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:44,028 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2024-11-07 05:15:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:15:44,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-07 05:15:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:44,040 INFO L225 Difference]: With dead ends: 139 [2024-11-07 05:15:44,040 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 05:15:44,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:15:44,050 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:44,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:15:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 05:15:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 05:15:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-07 05:15:44,106 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2024-11-07 05:15:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:44,106 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-07 05:15:44,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 05:15:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-07 05:15:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:44,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:44,112 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:44,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:15:44,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -509668076, now seen corresponding path program 1 times [2024-11-07 05:15:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:15:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012970801] [2024-11-07 05:15:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:15:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:15:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:15:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:15:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:15:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:15:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:15:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:15:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:15:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:15:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:15:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:15:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:15:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:15:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:15:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:15:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:15:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:15:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:15:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:15:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:15:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:15:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:15:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 05:15:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:15:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012970801] [2024-11-07 05:15:44,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012970801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:44,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:15:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689670316] [2024-11-07 05:15:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:15:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:15:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:15:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:15:44,558 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:44,596 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2024-11-07 05:15:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:15:44,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-07 05:15:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:44,601 INFO L225 Difference]: With dead ends: 135 [2024-11-07 05:15:44,601 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 05:15:44,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:15:44,603 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:44,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:15:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 05:15:44,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 05:15:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-07 05:15:44,618 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2024-11-07 05:15:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:44,622 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-07 05:15:44,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-07 05:15:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:44,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:44,625 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:15:44,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1319014702, now seen corresponding path program 1 times [2024-11-07 05:15:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:15:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781978529] [2024-11-07 05:15:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:15:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:15:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:15:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:15:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:15:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:15:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:15:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:15:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:15:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:15:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:15:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:15:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:15:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:15:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:15:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:15:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:15:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:15:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:15:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:15:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:15:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:15:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 05:15:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:15:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 05:15:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:15:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781978529] [2024-11-07 05:15:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781978529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:15:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123338331] [2024-11-07 05:15:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:45,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:15:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:15:45,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:15:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:15:45,539 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:45,907 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2024-11-07 05:15:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:15:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-07 05:15:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:45,910 INFO L225 Difference]: With dead ends: 215 [2024-11-07 05:15:45,910 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 05:15:45,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:15:45,911 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:45,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 295 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:15:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 05:15:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2024-11-07 05:15:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 68 states have internal predecessors, (85), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:15:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-11-07 05:15:45,947 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 152 [2024-11-07 05:15:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-11-07 05:15:45,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-11-07 05:15:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:45,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:45,949 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:45,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:15:45,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:45,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1317167660, now seen corresponding path program 1 times [2024-11-07 05:15:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:15:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054907800] [2024-11-07 05:15:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:15:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:15:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484017825] [2024-11-07 05:15:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:15:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:15:46,070 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:15:46,072 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:15:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:15:46,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:15:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:15:46,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:15:46,713 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:15:46,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:15:46,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:15:46,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:15:46,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 05:15:47,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:15:47,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:15:47 BoogieIcfgContainer [2024-11-07 05:15:47,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:15:47,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:15:47,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:15:47,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:15:47,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:43" (3/4) ... [2024-11-07 05:15:47,048 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:15:47,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:15:47,050 INFO L158 Benchmark]: Toolchain (without parser) took 4676.45ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.9MB in the beginning and 33.8MB in the end (delta: 43.1MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-11-07 05:15:47,050 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:15:47,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.95ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:15:47,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.03ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:15:47,051 INFO L158 Benchmark]: Boogie Preprocessor took 72.33ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:15:47,051 INFO L158 Benchmark]: RCFGBuilder took 535.70ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 65.1MB in the end (delta: -13.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-07 05:15:47,051 INFO L158 Benchmark]: TraceAbstraction took 3693.17ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 34.7MB in the end (delta: 29.9MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-11-07 05:15:47,052 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 125.8MB. Free memory was 34.7MB in the beginning and 33.8MB in the end (delta: 952.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:15:47,053 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.78ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.95ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.03ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.33ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 51.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 535.70ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 65.1MB in the end (delta: -13.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3693.17ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 34.7MB in the end (delta: 29.9MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 125.8MB. Free memory was 34.7MB in the beginning and 33.8MB in the end (delta: 952.1kB). 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 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] float var_1_31 = 127.75; [L42] float var_1_32 = 15.5; [L43] unsigned long int var_1_33 = 16; [L44] signed long int var_1_34 = 256; [L45] unsigned char var_1_35 = 0; [L46] signed short int var_1_36 = 8; [L47] signed long int var_1_37 = 256; [L48] unsigned long int var_1_38 = 500; [L49] unsigned char last_1_var_1_9 = 1; [L50] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L153] last_1_var_1_9 = var_1_9 [L154] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L117] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L118] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L119] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=5, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L134] var_1_28 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L137] var_1_29 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L140] var_1_32 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L142] var_1_35 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L145] var_1_36 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_36 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_36 >= -1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=256, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L148] var_1_37 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_37 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_37 >= -2147483647) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_37 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_37 <= 2147483646) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L55] COND TRUE -32 <= var_1_28 [L56] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L58] var_1_31 = var_1_32 [L59] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L60] COND FALSE !(var_1_31 > var_1_32) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L65] COND TRUE ((var_1_36 - var_1_29) * var_1_27) > var_1_28 [L66] var_1_34 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=500, var_1_4=16, var_1_8=0, var_1_9=1] [L71] COND FALSE !(var_1_34 < var_1_37) [L74] var_1_38 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L76] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L83] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L85] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=1] [L86] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L89] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L93] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_25 = var_1_20 [L105] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=4, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L106] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L107] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=4, var_1_15=4, var_1_16=4, var_1_17=127/5, var_1_1=4, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=2, var_1_37=-2147483647, var_1_38=0, var_1_4=16, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 274 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 325 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3036/3036 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:15:47,079 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_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:15:49,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:15:49,489 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:15:49,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:15:49,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:15:49,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:15:49,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:15:49,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:15:49,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:15:49,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:15:49,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:15:49,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:15:49,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:15:49,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:15:49,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:15:49,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:15:49,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:15:49,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:15:49,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:15:49,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:15:49,533 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2024-11-07 05:15:49,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:15:49,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:15:49,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:15:49,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:15:49,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:15:49,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:51,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:15:51,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:15:51,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:51,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014273077/bdf7a2c1ea2446b8806bc36cf7d1cb6f/FLAG0e8a86c0b [2024-11-07 05:15:51,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/014273077/bdf7a2c1ea2446b8806bc36cf7d1cb6f [2024-11-07 05:15:51,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:15:51,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:15:51,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:15:51,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:15:51,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:15:51,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51, skipping insertion in model container [2024-11-07 05:15:51,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:15:51,670 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_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-07 05:15:51,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:15:51,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:15:51,781 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_fillercodesize_ps-cn-25_file-40.i[915,928] [2024-11-07 05:15:51,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:15:51,842 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:15:51,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51 WrapperNode [2024-11-07 05:15:51,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:15:51,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:15:51,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:15:51,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:15:51,853 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:15:51" (1/1) ... [2024-11-07 05:15:51,862 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:15:51" (1/1) ... [2024-11-07 05:15:51,893 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-07 05:15:51,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:15:51,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:15:51,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:15:51,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:15:51,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,922 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:15:51,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:15:51,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:15:51,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:15:51,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:15:51,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (1/1) ... [2024-11-07 05:15:51,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:15:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:15:51,992 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:15:51,999 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:15:52,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:15:52,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:15:52,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:15:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:15:52,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:15:52,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:15:52,096 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:15:52,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:15:52,651 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:15:52,651 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:15:52,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:15:52,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:15:52,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:52 BoogieIcfgContainer [2024-11-07 05:15:52,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:15:52,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:15:52,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:15:52,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:15:52,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:15:51" (1/3) ... [2024-11-07 05:15:52,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79794e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:52, skipping insertion in model container [2024-11-07 05:15:52,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:15:51" (2/3) ... [2024-11-07 05:15:52,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79794e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:15:52, skipping insertion in model container [2024-11-07 05:15:52,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:15:52" (3/3) ... [2024-11-07 05:15:52,677 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2024-11-07 05:15:52,691 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:15:52,691 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:15:52,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:15:52,764 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;@4316be02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:15:52,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:15:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:15:52,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:52,783 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:52,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -147971958, now seen corresponding path program 1 times [2024-11-07 05:15:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741462102] [2024-11-07 05:15:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:52,796 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:15:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:52,799 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:15:52,801 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:15:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:53,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:15:53,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-07 05:15:53,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:15:53,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741462102] [2024-11-07 05:15:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741462102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:15:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715366919] [2024-11-07 05:15:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:15:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:15:53,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:15:53,190 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 05:15:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:53,212 INFO L93 Difference]: Finished difference Result 139 states and 241 transitions. [2024-11-07 05:15:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:15:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-07 05:15:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:53,222 INFO L225 Difference]: With dead ends: 139 [2024-11-07 05:15:53,222 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 05:15:53,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:15:53,231 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:53,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:15:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 05:15:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 05:15:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-07 05:15:53,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2024-11-07 05:15:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:53,276 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-07 05:15:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 05:15:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-07 05:15:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:53,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:53,281 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:53,291 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:15:53,482 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:15:53,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -509668076, now seen corresponding path program 1 times [2024-11-07 05:15:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:53,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892537633] [2024-11-07 05:15:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:53,485 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:15:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:53,488 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:15:53,491 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:15:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:53,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:15:53,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 05:15:53,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:15:53,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892537633] [2024-11-07 05:15:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892537633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:15:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822809398] [2024-11-07 05:15:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:15:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:15:53,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:15:53,890 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:54,123 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2024-11-07 05:15:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:15:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-07 05:15:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:54,138 INFO L225 Difference]: With dead ends: 135 [2024-11-07 05:15:54,138 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 05:15:54,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:15:54,139 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:54,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:15:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 05:15:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 05:15:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 05:15:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-07 05:15:54,155 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2024-11-07 05:15:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:54,156 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-07 05:15:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-07 05:15:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:54,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:54,159 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:54,168 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:15:54,360 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:15:54,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:54,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1319014702, now seen corresponding path program 1 times [2024-11-07 05:15:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647041701] [2024-11-07 05:15:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:54,361 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:15:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:54,364 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:15:54,365 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:15:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:54,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:15:54,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 05:15:54,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:15:54,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647041701] [2024-11-07 05:15:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647041701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:54,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:15:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410776701] [2024-11-07 05:15:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:54,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:15:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:15:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:15:54,873 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:56,189 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2024-11-07 05:15:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:15:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-07 05:15:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:56,193 INFO L225 Difference]: With dead ends: 282 [2024-11-07 05:15:56,193 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 05:15:56,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:15:56,195 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 247 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:56,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 416 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:15:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 05:15:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 128. [2024-11-07 05:15:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 05:15:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-11-07 05:15:56,242 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 152 [2024-11-07 05:15:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:56,243 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-11-07 05:15:56,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 05:15:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-11-07 05:15:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 05:15:56,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:56,247 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:15:56,256 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:15:56,448 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:15:56,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1317167660, now seen corresponding path program 1 times [2024-11-07 05:15:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548297399] [2024-11-07 05:15:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:56,449 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:15:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:56,452 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:15:56,453 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:15:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:56,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 05:15:56,693 INFO L278 TraceCheckSpWp]: Computing forward predicates...