./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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', '909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:20,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:20,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:16:20,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:20,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:20,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:20,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:20,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:20,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:20,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:20,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:20,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:20,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:20,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:20,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:20,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:20,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:20,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:20,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:20,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:20,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:20,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:20,236 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2024-11-07 06:16:20,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:20,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:20,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:20,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:20,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:20,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:21,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:22,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:22,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:22,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2ea6f99e/1fb32c232c3249e6b071ca362b109ad6/FLAG76da59641 [2024-11-07 06:16:22,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2ea6f99e/1fb32c232c3249e6b071ca362b109ad6 [2024-11-07 06:16:22,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:22,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:22,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:22,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:22,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:22,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a4d667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22, skipping insertion in model container [2024-11-07 06:16:22,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:22,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i[919,932] [2024-11-07 06:16:22,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:22,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:22,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i[919,932] [2024-11-07 06:16:22,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:22,449 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:22,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22 WrapperNode [2024-11-07 06:16:22,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:22,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:22,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:22,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:22,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,500 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 06:16:22,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:22,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:22,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:22,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:22,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,541 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:16:22,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:22,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:22,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:22,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:22,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (1/1) ... [2024-11-07 06:16:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:22,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:16:22,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:16:22,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:22,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:22,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:22,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:16:22,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:22,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:22,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:22,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:23,246 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:23,246 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:23,253 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:23,253 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:23,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:23 BoogieIcfgContainer [2024-11-07 06:16:23,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:23,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:23,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:23,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:23,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:22" (1/3) ... [2024-11-07 06:16:23,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad11219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:23, skipping insertion in model container [2024-11-07 06:16:23,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:22" (2/3) ... [2024-11-07 06:16:23,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad11219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:23, skipping insertion in model container [2024-11-07 06:16:23,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:23" (3/3) ... [2024-11-07 06:16:23,269 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:23,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:23,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:23,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:23,339 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;@7df59d61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:23,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:16:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:16:23,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:23,356 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:23,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:23,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1613466661, now seen corresponding path program 1 times [2024-11-07 06:16:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924082267] [2024-11-07 06:16:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:16:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:16:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:16:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924082267] [2024-11-07 06:16:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924082267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592864196] [2024-11-07 06:16:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:23,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:23,763 INFO L87 Difference]: Start difference. First operand has 94 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:16:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:23,794 INFO L93 Difference]: Finished difference Result 181 states and 308 transitions. [2024-11-07 06:16:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:23,796 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-07 06:16:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:23,802 INFO L225 Difference]: With dead ends: 181 [2024-11-07 06:16:23,802 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 06:16:23,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:23,809 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:23,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 06:16:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 06:16:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:16:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-11-07 06:16:23,860 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 140 [2024-11-07 06:16:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-11-07 06:16:23,861 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:16:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-11-07 06:16:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:16:23,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:23,868 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:16:23,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1708593951, now seen corresponding path program 1 times [2024-11-07 06:16:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288219929] [2024-11-07 06:16:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:16:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:16:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:16:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288219929] [2024-11-07 06:16:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288219929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:16:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877740547] [2024-11-07 06:16:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:24,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:24,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:24,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:24,479 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:24,744 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2024-11-07 06:16:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:24,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-07 06:16:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:24,748 INFO L225 Difference]: With dead ends: 320 [2024-11-07 06:16:24,748 INFO L226 Difference]: Without dead ends: 233 [2024-11-07 06:16:24,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:16:24,753 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 237 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:24,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 429 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-07 06:16:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 228. [2024-11-07 06:16:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.5) internal successors, (270), 181 states have internal predecessors, (270), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 06:16:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 358 transitions. [2024-11-07 06:16:24,805 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 358 transitions. Word has length 140 [2024-11-07 06:16:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:24,807 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 358 transitions. [2024-11-07 06:16:24,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 358 transitions. [2024-11-07 06:16:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:16:24,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:24,810 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:16:24,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1885308767, now seen corresponding path program 1 times [2024-11-07 06:16:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882242385] [2024-11-07 06:16:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:16:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:16:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:16:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:25,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882242385] [2024-11-07 06:16:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882242385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:16:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353580177] [2024-11-07 06:16:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:25,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:25,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:25,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:25,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:25,445 INFO L87 Difference]: Start difference. First operand 228 states and 358 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:25,634 INFO L93 Difference]: Finished difference Result 622 states and 976 transitions. [2024-11-07 06:16:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-07 06:16:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:25,639 INFO L225 Difference]: With dead ends: 622 [2024-11-07 06:16:25,639 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 06:16:25,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:25,641 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 102 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:25,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 481 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:16:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 06:16:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 271. [2024-11-07 06:16:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 202 states have internal predecessors, (291), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:16:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2024-11-07 06:16:25,693 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 140 [2024-11-07 06:16:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:25,694 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2024-11-07 06:16:25,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2024-11-07 06:16:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 06:16:25,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:25,700 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:16:25,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 855580788, now seen corresponding path program 1 times [2024-11-07 06:16:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978420948] [2024-11-07 06:16:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:16:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:16:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:16:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:16:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:16:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 06:16:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978420948] [2024-11-07 06:16:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978420948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929353599] [2024-11-07 06:16:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:26,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:16:26,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 06:16:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:26,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:16:26,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-07 06:16:26,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 06:16:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929353599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:27,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-11-07 06:16:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402407023] [2024-11-07 06:16:27,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:27,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:16:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:27,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:16:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:16:27,047 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 06:16:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:27,692 INFO L93 Difference]: Finished difference Result 663 states and 997 transitions. [2024-11-07 06:16:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 06:16:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 141 [2024-11-07 06:16:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:27,697 INFO L225 Difference]: With dead ends: 663 [2024-11-07 06:16:27,697 INFO L226 Difference]: Without dead ends: 438 [2024-11-07 06:16:27,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:16:27,701 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 517 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:27,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 351 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:16:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-07 06:16:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 418. [2024-11-07 06:16:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 315 states have (on average 1.3047619047619048) internal successors, (411), 319 states have internal predecessors, (411), 88 states have call successors, (88), 14 states have call predecessors, (88), 14 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-07 06:16:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2024-11-07 06:16:27,753 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 141 [2024-11-07 06:16:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2024-11-07 06:16:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 06:16:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2024-11-07 06:16:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 06:16:27,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:27,755 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:27,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:16:27,959 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 06:16:27,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -981770607, now seen corresponding path program 1 times [2024-11-07 06:16:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38438484] [2024-11-07 06:16:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:16:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240141738] [2024-11-07 06:16:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:28,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:16:28,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:16:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:28,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:16:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:28,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:16:28,318 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:16:28,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:16:28,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:16:28,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:28,528 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 06:16:28,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:16:28,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:16:28 BoogieIcfgContainer [2024-11-07 06:16:28,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:16:28,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:16:28,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:16:28,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:16:28,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:23" (3/4) ... [2024-11-07 06:16:28,644 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:16:28,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:16:28,645 INFO L158 Benchmark]: Toolchain (without parser) took 6526.55ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.5MB in the beginning and 79.8MB in the end (delta: 11.7MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,645 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.26ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.23ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 71.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,646 INFO L158 Benchmark]: Boogie Preprocessor took 71.61ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 66.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,646 INFO L158 Benchmark]: RCFGBuilder took 680.05ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 82.9MB in the end (delta: -16.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,647 INFO L158 Benchmark]: TraceAbstraction took 5385.21ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-07 06:16:28,647 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 201.3MB. Free memory was 79.8MB in the beginning and 79.8MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:28,648 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.87ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.26ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 76.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.23ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 71.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.61ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 66.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 680.05ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 82.9MB in the end (delta: -16.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5385.21ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 201.3MB. Free memory was 79.8MB in the beginning and 79.8MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 173. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] signed short int var_1_23 = -10; [L41] unsigned long int var_1_30 = 1000000000; [L42] float var_1_33 = 99.25; [L43] signed long int var_1_34 = 10; [L44] unsigned char var_1_35 = 16; [L45] signed long int var_1_39 = -128; [L46] signed long int var_1_40 = 1792665454; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L169] last_1_var_1_8 = var_1_8 [L170] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L180] RET updateLastVariables() [L181] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] var_1_7 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] var_1_19 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] var_1_40 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L181] RET updateVariables() [L182] CALL step() [L52] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L53] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L54] COND TRUE \read(last_1_var_1_8) [L55] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND FALSE !(var_1_5 < var_1_3) [L63] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L65] COND TRUE \read(var_1_7) [L66] var_1_34 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L68] EXPR var_1_4 >> var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L68] COND FALSE !(var_1_4 > (var_1_4 >> var_1_4)) [L75] var_1_39 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L77] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L78] COND TRUE 128u <= var_1_19 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L79] COND FALSE !((var_1_12 >= var_1_12) && ((var_1_19 * var_1_15) < ((((var_1_1) < (var_1_19)) ? (var_1_1) : (var_1_19))))) [L90] var_1_23 = 5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L93] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=1000000000, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L98] COND TRUE var_1_1 >= var_1_14 [L99] var_1_30 = (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) - var_1_2) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=16, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L101] COND TRUE var_1_19 > var_1_3 [L102] var_1_35 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L110] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=0, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L111] COND FALSE !(stepLocal_3 || (var_1_8 && var_1_10)) [L114] var_1_18 = var_1_2 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=127/8, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L116] var_1_20 = ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13))) [L117] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L118] COND FALSE !(var_1_4 == stepLocal_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=397/4, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L121] var_1_33 = var_1_12 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L122] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L122] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L123] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L182] RET step() [L183] CALL, EXPR property() [L173] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L173-L174] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=1, var_1_19=2147483647, var_1_1=50, var_1_20=2, var_1_23=5, var_1_2=1, var_1_30=2147483646, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 856 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 908 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 493 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 151 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 837 ConstructedInterpolants, 0 QuantifiedInterpolants, 1482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4515/4560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 06:16:28,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.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 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:30,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:30,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:16:30,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:30,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:30,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:30,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:30,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:30,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:30,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:30,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:30,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:30,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:30,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:30,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:30,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:30,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:30,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:30,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:30,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:30,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:30,950 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 -> 909c9504b0868e357efa477d58c1ea468ab6af597996618554c1b51a2983dcf4 [2024-11-07 06:16:31,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:31,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:31,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:31,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:31,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:31,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:32,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:32,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:32,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:32,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a16a00912/b7de42aa8a664ac9a1dcfbbac2ef087d/FLAG2aafa0502 [2024-11-07 06:16:32,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a16a00912/b7de42aa8a664ac9a1dcfbbac2ef087d [2024-11-07 06:16:32,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:32,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:32,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:32,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:32,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:32,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:32" (1/1) ... [2024-11-07 06:16:32,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f7a025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:32, skipping insertion in model container [2024-11-07 06:16:32,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:32" (1/1) ... [2024-11-07 06:16:32,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:33,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i[919,932] [2024-11-07 06:16:33,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:33,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:33,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i[919,932] [2024-11-07 06:16:33,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:33,189 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:33,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33 WrapperNode [2024-11-07 06:16:33,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:33,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:33,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:33,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:33,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,244 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-07 06:16:33,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:33,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:33,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:33,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:33,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,279 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 06:16:33,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:33,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:33,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:33,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:33,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (1/1) ... [2024-11-07 06:16:33,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:33,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:33,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 06:16:33,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 06:16:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:16:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:33,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:33,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:33,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:33,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:34,534 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:34,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:34,544 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:34,545 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:34,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:34 BoogieIcfgContainer [2024-11-07 06:16:34,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:34,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:34,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:34,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:34,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:32" (1/3) ... [2024-11-07 06:16:34,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150f5143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:34, skipping insertion in model container [2024-11-07 06:16:34,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:33" (2/3) ... [2024-11-07 06:16:34,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150f5143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:34, skipping insertion in model container [2024-11-07 06:16:34,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:34" (3/3) ... [2024-11-07 06:16:34,557 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-17.i [2024-11-07 06:16:34,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:34,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:34,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:34,633 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;@14065f9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:34,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:16:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 06:16:34,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:34,648 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:34,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -852751566, now seen corresponding path program 1 times [2024-11-07 06:16:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396859026] [2024-11-07 06:16:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:34,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:34,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:34,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:34,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:16:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:34,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:16:34,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-11-07 06:16:34,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:34,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396859026] [2024-11-07 06:16:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396859026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:34,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597432633] [2024-11-07 06:16:34,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:35,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:35,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:35,038 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:16:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:35,063 INFO L93 Difference]: Finished difference Result 143 states and 250 transitions. [2024-11-07 06:16:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 135 [2024-11-07 06:16:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:35,071 INFO L225 Difference]: With dead ends: 143 [2024-11-07 06:16:35,071 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 06:16:35,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:35,076 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:35,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 06:16:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 06:16:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:16:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-11-07 06:16:35,115 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 135 [2024-11-07 06:16:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:35,115 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-11-07 06:16:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:16:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-11-07 06:16:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 06:16:35,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:35,119 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:35,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 06:16:35,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:35,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash 193720686, now seen corresponding path program 1 times [2024-11-07 06:16:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754728543] [2024-11-07 06:16:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:35,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:35,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:35,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:16:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:35,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:16:35,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:16:35,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:35,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754728543] [2024-11-07 06:16:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754728543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248153808] [2024-11-07 06:16:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:35,939 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:36,546 INFO L93 Difference]: Finished difference Result 208 states and 328 transitions. [2024-11-07 06:16:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:36,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-11-07 06:16:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:36,566 INFO L225 Difference]: With dead ends: 208 [2024-11-07 06:16:36,566 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 06:16:36,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:36,567 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 70 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:36,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 366 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:16:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 06:16:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2024-11-07 06:16:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:16:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2024-11-07 06:16:36,587 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 135 [2024-11-07 06:16:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2024-11-07 06:16:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2024-11-07 06:16:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 06:16:36,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:36,589 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:36,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:16:36,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:36,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:36,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -831933005, now seen corresponding path program 1 times [2024-11-07 06:16:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:36,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999907119] [2024-11-07 06:16:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:36,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:36,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:36,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:36,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:16:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:37,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:16:37,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-07 06:16:37,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 06:16:37,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999907119] [2024-11-07 06:16:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999907119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:37,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:16:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 06:16:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620946390] [2024-11-07 06:16:37,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:37,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:16:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:16:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:16:37,379 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 06:16:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:38,017 INFO L93 Difference]: Finished difference Result 188 states and 283 transitions. [2024-11-07 06:16:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:16:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 136 [2024-11-07 06:16:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:38,033 INFO L225 Difference]: With dead ends: 188 [2024-11-07 06:16:38,033 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 06:16:38,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:16:38,035 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 173 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:38,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 182 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:16:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 06:16:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-07 06:16:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:16:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-11-07 06:16:38,048 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 136 [2024-11-07 06:16:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:38,048 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-11-07 06:16:38,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 06:16:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-11-07 06:16:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:16:38,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:38,050 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:38,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:16:38,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:38,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:38,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash 559131263, now seen corresponding path program 1 times [2024-11-07 06:16:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042136625] [2024-11-07 06:16:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:38,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:38,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:38,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:38,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:16:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:16:38,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-07 06:16:38,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 06:16:38,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042136625] [2024-11-07 06:16:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042136625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:38,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:16:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-07 06:16:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874734991] [2024-11-07 06:16:38,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:38,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:16:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:16:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:16:38,953 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 06:16:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:40,388 INFO L93 Difference]: Finished difference Result 272 states and 390 transitions. [2024-11-07 06:16:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 06:16:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 137 [2024-11-07 06:16:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:40,392 INFO L225 Difference]: With dead ends: 272 [2024-11-07 06:16:40,392 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 06:16:40,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-07 06:16:40,398 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 316 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:40,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 427 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 06:16:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 06:16:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 137. [2024-11-07 06:16:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:16:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-11-07 06:16:40,434 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 137 [2024-11-07 06:16:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:40,435 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-11-07 06:16:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-07 06:16:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-11-07 06:16:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:16:40,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:40,441 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:40,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:16:40,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:40,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1239189633, now seen corresponding path program 1 times [2024-11-07 06:16:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512856130] [2024-11-07 06:16:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:40,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:40,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:40,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:16:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:40,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:16:40,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 309 proven. 42 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2024-11-07 06:16:41,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:41,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512856130] [2024-11-07 06:16:41,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512856130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [365255031] [2024-11-07 06:16:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:16:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:16:41,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:16:41,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 06:16:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:42,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:16:42,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:16:42,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [365255031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:42,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:16:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-11-07 06:16:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023246634] [2024-11-07 06:16:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:16:42,842 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:43,863 INFO L93 Difference]: Finished difference Result 360 states and 506 transitions. [2024-11-07 06:16:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-07 06:16:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:43,867 INFO L225 Difference]: With dead ends: 360 [2024-11-07 06:16:43,867 INFO L226 Difference]: Without dead ends: 273 [2024-11-07 06:16:43,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:16:43,868 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:43,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 300 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:16:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-07 06:16:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 268. [2024-11-07 06:16:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.265625) internal successors, (243), 193 states have internal predecessors, (243), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 06:16:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 371 transitions. [2024-11-07 06:16:43,916 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 371 transitions. Word has length 137 [2024-11-07 06:16:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:43,916 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 371 transitions. [2024-11-07 06:16:43,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:16:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 371 transitions. [2024-11-07 06:16:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:16:43,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:43,919 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:43,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-07 06:16:44,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 06:16:44,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:44,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:44,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:44,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1280770301, now seen corresponding path program 1 times [2024-11-07 06:16:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446352774] [2024-11-07 06:16:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:44,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 06:16:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:44,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 06:16:44,512 INFO L278 TraceCheckSpWp]: Computing forward predicates...