./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.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_variablewrapping_wrapper-p_file-83.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', '4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43'] 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_variablewrapping_wrapper-p_file-83.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 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:39:02,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:39:02,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:39:02,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:39:02,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:39:02,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:39:02,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:39:02,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:39:02,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:39:02,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:39:02,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:39:02,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:39:02,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:39:02,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:39:02,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:39:02,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:39:02,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:39:02,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:39:02,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:39:02,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:39:02,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:39:02,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:39:02,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:39:02,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:39:02,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:39:02,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:39:02,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:39:02,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:39:02,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:39:02,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:39:02,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:39:02,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:39:02,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:39:02,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:39:02,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:39:02,558 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 -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2024-11-07 10:39:02,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:39:02,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:39:02,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:39:02,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:39:02,865 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:39:02,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:04,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:39:04,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:39:04,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:04,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4570cb271/c8d7018cb55645fcba100ae2fdddaebc/FLAG3f9b8b68d [2024-11-07 10:39:04,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4570cb271/c8d7018cb55645fcba100ae2fdddaebc [2024-11-07 10:39:04,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:39:04,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:39:04,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:39:04,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:39:04,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:39:04,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:39:04" (1/1) ... [2024-11-07 10:39:04,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c86671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:04, skipping insertion in model container [2024-11-07 10:39:04,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:39:04" (1/1) ... [2024-11-07 10:39:04,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:39:04,920 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_variablewrapping_wrapper-p_file-83.i[916,929] [2024-11-07 10:39:05,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:39:05,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:39:05,029 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_variablewrapping_wrapper-p_file-83.i[916,929] [2024-11-07 10:39:05,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:39:05,102 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:39:05,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05 WrapperNode [2024-11-07 10:39:05,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:39:05,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:39:05,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:39:05,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:39:05,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,180 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2024-11-07 10:39:05,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:39:05,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:39:05,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:39:05,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:39:05,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,221 INFO L175 MemorySlicer]: Split 130 memory accesses to 13 slices as follows [2, 12, 6, 28, 9, 7, 20, 14, 3, 5, 15, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2024-11-07 10:39:05,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:39:05,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:39:05,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:39:05,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:39:05,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (1/1) ... [2024-11-07 10:39:05,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:39:05,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:05,288 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 10:39:05,292 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 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:39:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:39:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:39:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:39:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:39:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 10:39:05,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 10:39:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 10:39:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 10:39:05,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:39:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:39:05,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:39:05,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:39:06,249 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-07 10:39:06,250 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:39:06,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:39:06,269 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:39:06,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:39:06 BoogieIcfgContainer [2024-11-07 10:39:06,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:39:06,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:39:06,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:39:06,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:39:06,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:39:04" (1/3) ... [2024-11-07 10:39:06,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea123fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:39:06, skipping insertion in model container [2024-11-07 10:39:06,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:05" (2/3) ... [2024-11-07 10:39:06,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea123fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:39:06, skipping insertion in model container [2024-11-07 10:39:06,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:39:06" (3/3) ... [2024-11-07 10:39:06,281 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:06,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:39:06,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:39:06,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:39:06,382 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;@495a9716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:39:06,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:39:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:06,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:06,399 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:06,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -767850232, now seen corresponding path program 1 times [2024-11-07 10:39:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72039356] [2024-11-07 10:39:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72039356] [2024-11-07 10:39:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72039356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:06,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:39:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086268676] [2024-11-07 10:39:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:06,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:39:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:06,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:39:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:39:06,899 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:06,936 INFO L93 Difference]: Finished difference Result 217 states and 337 transitions. [2024-11-07 10:39:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:39:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-07 10:39:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:06,945 INFO L225 Difference]: With dead ends: 217 [2024-11-07 10:39:06,945 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 10:39:06,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 10:39:06,952 INFO L432 NwaCegarLoop]: 153 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, 153 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 10:39:06,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 10:39:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 10:39:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2024-11-07 10:39:07,007 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2024-11-07 10:39:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:07,009 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2024-11-07 10:39:07,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2024-11-07 10:39:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:07,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:07,015 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:07,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:39:07,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:07,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1588599334, now seen corresponding path program 1 times [2024-11-07 10:39:07,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:07,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636269163] [2024-11-07 10:39:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636269163] [2024-11-07 10:39:07,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636269163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:07,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:07,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:07,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670721286] [2024-11-07 10:39:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:07,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:07,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:07,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:07,440 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:07,498 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2024-11-07 10:39:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-07 10:39:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:07,502 INFO L225 Difference]: With dead ends: 215 [2024-11-07 10:39:07,503 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:39:07,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:07,504 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:07,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:39:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-07 10:39:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-07 10:39:07,524 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2024-11-07 10:39:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:07,525 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-07 10:39:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-07 10:39:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:07,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:07,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:07,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:39:07,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:07,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:07,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1107519076, now seen corresponding path program 1 times [2024-11-07 10:39:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689565538] [2024-11-07 10:39:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689565538] [2024-11-07 10:39:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689565538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022666690] [2024-11-07 10:39:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:07,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:07,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:07,800 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:07,862 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-11-07 10:39:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:07,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 10:39:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:07,868 INFO L225 Difference]: With dead ends: 220 [2024-11-07 10:39:07,868 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:39:07,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:07,870 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:07,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:39:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 10:39:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-07 10:39:07,885 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2024-11-07 10:39:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-07 10:39:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-07 10:39:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:07,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:07,890 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:07,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:39:07,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -427460706, now seen corresponding path program 1 times [2024-11-07 10:39:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879423131] [2024-11-07 10:39:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879423131] [2024-11-07 10:39:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879423131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422575517] [2024-11-07 10:39:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:08,160 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:08,194 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2024-11-07 10:39:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 10:39:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:08,197 INFO L225 Difference]: With dead ends: 224 [2024-11-07 10:39:08,197 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 10:39:08,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:08,202 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:08,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 10:39:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-07 10:39:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-07 10:39:08,214 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2024-11-07 10:39:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-07 10:39:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-07 10:39:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:08,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:08,220 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:08,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:39:08,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:08,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1347546656, now seen corresponding path program 1 times [2024-11-07 10:39:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907887903] [2024-11-07 10:39:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907887903] [2024-11-07 10:39:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907887903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:08,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031851365] [2024-11-07 10:39:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:08,461 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:08,498 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2024-11-07 10:39:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 10:39:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:08,500 INFO L225 Difference]: With dead ends: 228 [2024-11-07 10:39:08,500 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 10:39:08,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:08,503 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:08,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 10:39:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-07 10:39:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-07 10:39:08,519 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2024-11-07 10:39:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:08,519 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-07 10:39:08,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-07 10:39:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:39:08,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:08,521 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:39:08,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1349393698, now seen corresponding path program 1 times [2024-11-07 10:39:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323425050] [2024-11-07 10:39:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323425050] [2024-11-07 10:39:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323425050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092978836] [2024-11-07 10:39:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:08,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:08,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:08,847 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:08,918 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2024-11-07 10:39:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 10:39:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:08,921 INFO L225 Difference]: With dead ends: 270 [2024-11-07 10:39:08,923 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 10:39:08,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:08,924 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 148 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:08,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 448 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 10:39:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2024-11-07 10:39:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2024-11-07 10:39:08,942 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 106 [2024-11-07 10:39:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:08,943 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2024-11-07 10:39:08,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2024-11-07 10:39:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:39:08,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:08,945 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:39:08,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 816080248, now seen corresponding path program 1 times [2024-11-07 10:39:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346316146] [2024-11-07 10:39:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:09,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346316146] [2024-11-07 10:39:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346316146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:09,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:09,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:39:09,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006958627] [2024-11-07 10:39:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:09,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:09,252 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:09,341 INFO L93 Difference]: Finished difference Result 231 states and 320 transitions. [2024-11-07 10:39:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-07 10:39:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:09,345 INFO L225 Difference]: With dead ends: 231 [2024-11-07 10:39:09,345 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 10:39:09,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:09,346 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:09,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 10:39:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 10:39:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-07 10:39:09,356 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 107 [2024-11-07 10:39:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:09,357 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-07 10:39:09,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-07 10:39:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:09,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:09,360 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:39:09,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1911144060, now seen corresponding path program 1 times [2024-11-07 10:39:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426742788] [2024-11-07 10:39:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426742788] [2024-11-07 10:39:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426742788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:10,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:10,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:39:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981671263] [2024-11-07 10:39:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:10,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:10,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:10,126 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:10,347 INFO L93 Difference]: Finished difference Result 314 states and 430 transitions. [2024-11-07 10:39:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-07 10:39:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:10,350 INFO L225 Difference]: With dead ends: 314 [2024-11-07 10:39:10,350 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 10:39:10,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:10,351 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:10,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 816 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:39:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 10:39:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-07 10:39:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 178 states have (on average 1.3370786516853932) internal successors, (238), 179 states have internal predecessors, (238), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:39:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 268 transitions. [2024-11-07 10:39:10,368 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 268 transitions. Word has length 108 [2024-11-07 10:39:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 268 transitions. [2024-11-07 10:39:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 268 transitions. [2024-11-07 10:39:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:10,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:10,371 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:10,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:39:10,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:10,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash 890075706, now seen corresponding path program 1 times [2024-11-07 10:39:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:10,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508554772] [2024-11-07 10:39:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491947639] [2024-11-07 10:39:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:10,504 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 10:39:10,505 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 10:39:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:10,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:39:10,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:11,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 10:39:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:11,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508554772] [2024-11-07 10:39:11,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491947639] [2024-11-07 10:39:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491947639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:39:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374717473] [2024-11-07 10:39:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:11,045 INFO L87 Difference]: Start difference. First operand 196 states and 268 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:11,183 INFO L93 Difference]: Finished difference Result 554 states and 760 transitions. [2024-11-07 10:39:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-07 10:39:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:11,190 INFO L225 Difference]: With dead ends: 554 [2024-11-07 10:39:11,190 INFO L226 Difference]: Without dead ends: 361 [2024-11-07 10:39:11,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:11,192 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 123 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:11,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 513 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-07 10:39:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 216. [2024-11-07 10:39:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 198 states have (on average 1.3535353535353536) internal successors, (268), 199 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:39:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 298 transitions. [2024-11-07 10:39:11,214 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 298 transitions. Word has length 108 [2024-11-07 10:39:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:11,215 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 298 transitions. [2024-11-07 10:39:11,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 298 transitions. [2024-11-07 10:39:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:11,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:11,217 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:11,239 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 10:39:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:11,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -698272196, now seen corresponding path program 1 times [2024-11-07 10:39:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988620367] [2024-11-07 10:39:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766621941] [2024-11-07 10:39:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:11,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:11,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:11,593 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 10:39:11,595 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 10:39:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:12,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:39:12,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:12,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988620367] [2024-11-07 10:39:12,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766621941] [2024-11-07 10:39:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766621941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:12,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:39:12,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380338976] [2024-11-07 10:39:12,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:12,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:12,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:12,333 INFO L87 Difference]: Start difference. First operand 216 states and 298 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:12,658 INFO L93 Difference]: Finished difference Result 759 states and 1052 transitions. [2024-11-07 10:39:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:39:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-07 10:39:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:12,662 INFO L225 Difference]: With dead ends: 759 [2024-11-07 10:39:12,663 INFO L226 Difference]: Without dead ends: 546 [2024-11-07 10:39:12,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:12,664 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 228 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:12,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 703 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:39:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-07 10:39:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 266. [2024-11-07 10:39:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 236 states have (on average 1.3347457627118644) internal successors, (315), 237 states have internal predecessors, (315), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 367 transitions. [2024-11-07 10:39:12,694 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 367 transitions. Word has length 108 [2024-11-07 10:39:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 367 transitions. [2024-11-07 10:39:12,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 367 transitions. [2024-11-07 10:39:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:12,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:12,696 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:12,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:39:12,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:12,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash 107130363, now seen corresponding path program 1 times [2024-11-07 10:39:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:12,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409632912] [2024-11-07 10:39:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409632912] [2024-11-07 10:39:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409632912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:13,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:39:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7360499] [2024-11-07 10:39:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:39:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:39:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:39:13,655 INFO L87 Difference]: Start difference. First operand 266 states and 367 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:39:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:14,046 INFO L93 Difference]: Finished difference Result 479 states and 662 transitions. [2024-11-07 10:39:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2024-11-07 10:39:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:14,049 INFO L225 Difference]: With dead ends: 479 [2024-11-07 10:39:14,049 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 10:39:14,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:39:14,051 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 360 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:14,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 528 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:39:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 10:39:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-07 10:39:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 236 states have (on average 1.326271186440678) internal successors, (313), 237 states have internal predecessors, (313), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 365 transitions. [2024-11-07 10:39:14,079 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 365 transitions. Word has length 108 [2024-11-07 10:39:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 365 transitions. [2024-11-07 10:39:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:39:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 365 transitions. [2024-11-07 10:39:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:14,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:14,084 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:39:14,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:14,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash 687931198, now seen corresponding path program 1 times [2024-11-07 10:39:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428660306] [2024-11-07 10:39:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428660306] [2024-11-07 10:39:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428660306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:15,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:15,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:39:15,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167457147] [2024-11-07 10:39:15,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:39:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:39:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:15,056 INFO L87 Difference]: Start difference. First operand 266 states and 365 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:15,934 INFO L93 Difference]: Finished difference Result 584 states and 803 transitions. [2024-11-07 10:39:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:39:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2024-11-07 10:39:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:15,937 INFO L225 Difference]: With dead ends: 584 [2024-11-07 10:39:15,938 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 10:39:15,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:39:15,939 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 461 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:15,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1010 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:39:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 10:39:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 297. [2024-11-07 10:39:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 268 states have internal predecessors, (358), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 410 transitions. [2024-11-07 10:39:15,962 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 410 transitions. Word has length 108 [2024-11-07 10:39:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:15,962 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 410 transitions. [2024-11-07 10:39:15,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 410 transitions. [2024-11-07 10:39:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:15,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:15,964 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:15,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:39:15,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:15,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1199526462, now seen corresponding path program 1 times [2024-11-07 10:39:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242691235] [2024-11-07 10:39:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242691235] [2024-11-07 10:39:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242691235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:39:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242562046] [2024-11-07 10:39:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:16,620 INFO L87 Difference]: Start difference. First operand 297 states and 410 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:17,094 INFO L93 Difference]: Finished difference Result 642 states and 888 transitions. [2024-11-07 10:39:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:17,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-07 10:39:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:17,098 INFO L225 Difference]: With dead ends: 642 [2024-11-07 10:39:17,098 INFO L226 Difference]: Without dead ends: 398 [2024-11-07 10:39:17,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:39:17,100 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 103 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:17,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1057 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:39:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-07 10:39:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 327. [2024-11-07 10:39:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 297 states have (on average 1.3501683501683501) internal successors, (401), 298 states have internal predecessors, (401), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 453 transitions. [2024-11-07 10:39:17,122 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 453 transitions. Word has length 108 [2024-11-07 10:39:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:17,122 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 453 transitions. [2024-11-07 10:39:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 453 transitions. [2024-11-07 10:39:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:39:17,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:17,124 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:39:17,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:17,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 178458108, now seen corresponding path program 1 times [2024-11-07 10:39:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:17,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533205283] [2024-11-07 10:39:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533205283] [2024-11-07 10:39:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533205283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:39:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582158608] [2024-11-07 10:39:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:17,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:39:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:39:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:17,759 INFO L87 Difference]: Start difference. First operand 327 states and 453 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:18,181 INFO L93 Difference]: Finished difference Result 688 states and 951 transitions. [2024-11-07 10:39:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:39:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2024-11-07 10:39:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:18,184 INFO L225 Difference]: With dead ends: 688 [2024-11-07 10:39:18,184 INFO L226 Difference]: Without dead ends: 414 [2024-11-07 10:39:18,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:39:18,188 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 343 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:18,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1212 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:39:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-07 10:39:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2024-11-07 10:39:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 378 states have (on average 1.3518518518518519) internal successors, (511), 380 states have internal predecessors, (511), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 567 transitions. [2024-11-07 10:39:18,224 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 567 transitions. Word has length 108 [2024-11-07 10:39:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:18,224 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 567 transitions. [2024-11-07 10:39:18,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 567 transitions. [2024-11-07 10:39:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:39:18,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:18,226 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:18,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:39:18,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:18,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 991848051, now seen corresponding path program 1 times [2024-11-07 10:39:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525558350] [2024-11-07 10:39:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121347456] [2024-11-07 10:39:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:18,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:18,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:39:18,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 10:39:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:18,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:39:18,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:18,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:39:18,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 10:39:18,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 10:39:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:18,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525558350] [2024-11-07 10:39:18,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121347456] [2024-11-07 10:39:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121347456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:39:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962972397] [2024-11-07 10:39:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:18,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:39:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:39:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:18,775 INFO L87 Difference]: Start difference. First operand 411 states and 567 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:18,933 INFO L93 Difference]: Finished difference Result 1006 states and 1386 transitions. [2024-11-07 10:39:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:39:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-07 10:39:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:18,939 INFO L225 Difference]: With dead ends: 1006 [2024-11-07 10:39:18,940 INFO L226 Difference]: Without dead ends: 648 [2024-11-07 10:39:18,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:18,943 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 118 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:18,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 804 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-07 10:39:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 411. [2024-11-07 10:39:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 378 states have (on average 1.3518518518518519) internal successors, (511), 380 states have internal predecessors, (511), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 567 transitions. [2024-11-07 10:39:18,985 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 567 transitions. Word has length 109 [2024-11-07 10:39:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 567 transitions. [2024-11-07 10:39:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 567 transitions. [2024-11-07 10:39:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:39:18,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:18,990 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:19,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 10:39:19,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:19,195 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:19,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash -596499851, now seen corresponding path program 1 times [2024-11-07 10:39:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329700966] [2024-11-07 10:39:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820978428] [2024-11-07 10:39:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:19,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:19,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:39:19,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 10:39:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:19,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 10:39:19,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:20,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:20,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 10:39:20,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:20,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 10:39:20,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:20,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:39:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-07 10:39:20,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329700966] [2024-11-07 10:39:21,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820978428] [2024-11-07 10:39:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820978428] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-11-07 10:39:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415562870] [2024-11-07 10:39:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:21,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:39:21,006 INFO L87 Difference]: Start difference. First operand 411 states and 567 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:21,235 INFO L93 Difference]: Finished difference Result 865 states and 1189 transitions. [2024-11-07 10:39:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-07 10:39:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:21,238 INFO L225 Difference]: With dead ends: 865 [2024-11-07 10:39:21,239 INFO L226 Difference]: Without dead ends: 505 [2024-11-07 10:39:21,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:21,240 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 69 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:21,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 675 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:39:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-07 10:39:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 409. [2024-11-07 10:39:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 376 states have (on average 1.3430851063829787) internal successors, (505), 378 states have internal predecessors, (505), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 561 transitions. [2024-11-07 10:39:21,270 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 561 transitions. Word has length 109 [2024-11-07 10:39:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 561 transitions. [2024-11-07 10:39:21,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 561 transitions. [2024-11-07 10:39:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:21,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:21,272 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:21,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 10:39:21,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 10:39:21,477 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:21,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -662709091, now seen corresponding path program 1 times [2024-11-07 10:39:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567327738] [2024-11-07 10:39:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989220879] [2024-11-07 10:39:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:21,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:21,549 INFO L229 MonitoredProcess]: Starting monitored process 6 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 10:39:21,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 10:39:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:22,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 10:39:22,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:22,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:22,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 10:39:22,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 10:39:23,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:39:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 150 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 10:39:23,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567327738] [2024-11-07 10:39:24,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989220879] [2024-11-07 10:39:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989220879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:24,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-07 10:39:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359860107] [2024-11-07 10:39:24,146 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 10:39:24,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:39:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:39:24,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:39:24,148 INFO L87 Difference]: Start difference. First operand 409 states and 561 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:25,232 INFO L93 Difference]: Finished difference Result 1142 states and 1561 transitions. [2024-11-07 10:39:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 10:39:25,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 110 [2024-11-07 10:39:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:25,237 INFO L225 Difference]: With dead ends: 1142 [2024-11-07 10:39:25,237 INFO L226 Difference]: Without dead ends: 786 [2024-11-07 10:39:25,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 10:39:25,240 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 419 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:25,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1810 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:39:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-07 10:39:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 442. [2024-11-07 10:39:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 408 states have (on average 1.3455882352941178) internal successors, (549), 410 states have internal predecessors, (549), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 605 transitions. [2024-11-07 10:39:25,269 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 605 transitions. Word has length 110 [2024-11-07 10:39:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:25,270 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 605 transitions. [2024-11-07 10:39:25,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:39:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 605 transitions. [2024-11-07 10:39:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:25,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:25,274 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:25,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 10:39:25,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 10:39:25,474 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 380991517, now seen corresponding path program 1 times [2024-11-07 10:39:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:25,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614217061] [2024-11-07 10:39:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910065482] [2024-11-07 10:39:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:25,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:25,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:25,571 INFO L229 MonitoredProcess]: Starting monitored process 7 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 10:39:25,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 10:39:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:25,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 10:39:26,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:26,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-07 10:39:26,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:26,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 10:39:26,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:26,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-07 10:39:26,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-07 10:39:26,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-07 10:39:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 10:39:26,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614217061] [2024-11-07 10:39:27,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:27,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910065482] [2024-11-07 10:39:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910065482] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2024-11-07 10:39:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637366610] [2024-11-07 10:39:27,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:27,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:39:27,238 INFO L87 Difference]: Start difference. First operand 442 states and 605 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:27,982 INFO L93 Difference]: Finished difference Result 846 states and 1157 transitions. [2024-11-07 10:39:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-07 10:39:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:27,985 INFO L225 Difference]: With dead ends: 846 [2024-11-07 10:39:27,986 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 10:39:27,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:39:27,987 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 100 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:27,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1055 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:39:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 10:39:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 431. [2024-11-07 10:39:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 397 states have (on average 1.3425692695214106) internal successors, (533), 399 states have internal predecessors, (533), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 589 transitions. [2024-11-07 10:39:28,014 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 589 transitions. Word has length 110 [2024-11-07 10:39:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:28,014 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 589 transitions. [2024-11-07 10:39:28,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 589 transitions. [2024-11-07 10:39:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:28,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:28,016 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:28,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 10:39:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 10:39:28,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash -620457574, now seen corresponding path program 1 times [2024-11-07 10:39:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669024719] [2024-11-07 10:39:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669024719] [2024-11-07 10:39:28,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669024719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:28,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:28,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:39:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972891175] [2024-11-07 10:39:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:28,402 INFO L87 Difference]: Start difference. First operand 431 states and 589 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:28,535 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2024-11-07 10:39:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-07 10:39:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:28,540 INFO L225 Difference]: With dead ends: 1021 [2024-11-07 10:39:28,540 INFO L226 Difference]: Without dead ends: 665 [2024-11-07 10:39:28,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:28,541 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 115 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:28,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 685 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-07 10:39:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 507. [2024-11-07 10:39:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 473 states have (on average 1.3340380549682875) internal successors, (631), 475 states have internal predecessors, (631), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 687 transitions. [2024-11-07 10:39:28,575 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 687 transitions. Word has length 110 [2024-11-07 10:39:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 687 transitions. [2024-11-07 10:39:28,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 687 transitions. [2024-11-07 10:39:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:28,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:28,577 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:28,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:39:28,578 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:28,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -43314004, now seen corresponding path program 1 times [2024-11-07 10:39:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461220519] [2024-11-07 10:39:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:28,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461220519] [2024-11-07 10:39:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461220519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:28,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:39:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829941651] [2024-11-07 10:39:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:28,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:39:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:39:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:39:28,685 INFO L87 Difference]: Start difference. First operand 507 states and 687 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:28,707 INFO L93 Difference]: Finished difference Result 924 states and 1257 transitions. [2024-11-07 10:39:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:39:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-07 10:39:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:28,713 INFO L225 Difference]: With dead ends: 924 [2024-11-07 10:39:28,713 INFO L226 Difference]: Without dead ends: 495 [2024-11-07 10:39:28,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:39:28,714 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:28,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-07 10:39:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2024-11-07 10:39:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 461 states have (on average 1.3297180043383947) internal successors, (613), 463 states have internal predecessors, (613), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 669 transitions. [2024-11-07 10:39:28,743 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 669 transitions. Word has length 110 [2024-11-07 10:39:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 669 transitions. [2024-11-07 10:39:28,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 669 transitions. [2024-11-07 10:39:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:28,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:28,747 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:28,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 10:39:28,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:28,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1431985501, now seen corresponding path program 1 times [2024-11-07 10:39:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026238695] [2024-11-07 10:39:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:28,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:39:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:39:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:39:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:39:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:39:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:39:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:39:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:39:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:39:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:39:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:39:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026238695] [2024-11-07 10:39:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026238695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:39:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553713049] [2024-11-07 10:39:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:28,985 INFO L87 Difference]: Start difference. First operand 495 states and 669 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:29,046 INFO L93 Difference]: Finished difference Result 890 states and 1208 transitions. [2024-11-07 10:39:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:29,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-07 10:39:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:29,050 INFO L225 Difference]: With dead ends: 890 [2024-11-07 10:39:29,050 INFO L226 Difference]: Without dead ends: 429 [2024-11-07 10:39:29,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:29,052 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 67 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:29,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 558 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-07 10:39:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2024-11-07 10:39:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 393 states have (on average 1.3053435114503817) internal successors, (513), 395 states have internal predecessors, (513), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 569 transitions. [2024-11-07 10:39:29,086 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 569 transitions. Word has length 110 [2024-11-07 10:39:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:29,087 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 569 transitions. [2024-11-07 10:39:29,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 569 transitions. [2024-11-07 10:39:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:39:29,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:29,089 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:29,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 10:39:29,089 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:29,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash 38890783, now seen corresponding path program 1 times [2024-11-07 10:39:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401682872] [2024-11-07 10:39:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803782095] [2024-11-07 10:39:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:29,183 INFO L229 MonitoredProcess]: Starting monitored process 8 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 10:39:29,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 10:39:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:29,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:39:29,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:29,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:29,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-07 10:39:29,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:39:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-07 10:39:29,986 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:39:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401682872] [2024-11-07 10:39:30,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:39:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803782095] [2024-11-07 10:39:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803782095] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:30,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-07 10:39:30,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487225648] [2024-11-07 10:39:30,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:30,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:39:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:39:30,134 INFO L87 Difference]: Start difference. First operand 427 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:30,262 INFO L93 Difference]: Finished difference Result 858 states and 1144 transitions. [2024-11-07 10:39:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:30,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-07 10:39:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:30,266 INFO L225 Difference]: With dead ends: 858 [2024-11-07 10:39:30,267 INFO L226 Difference]: Without dead ends: 499 [2024-11-07 10:39:30,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:39:30,271 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:30,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 537 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-07 10:39:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 409. [2024-11-07 10:39:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 375 states have (on average 1.2986666666666666) internal successors, (487), 377 states have internal predecessors, (487), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:39:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 543 transitions. [2024-11-07 10:39:30,294 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 543 transitions. Word has length 110 [2024-11-07 10:39:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 543 transitions. [2024-11-07 10:39:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 543 transitions. [2024-11-07 10:39:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:39:30,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:30,297 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:30,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 10:39:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:30,498 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2028322097, now seen corresponding path program 1 times [2024-11-07 10:39:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:39:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144515710] [2024-11-07 10:39:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:39:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:39:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624157643] [2024-11-07 10:39:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:30,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:30,561 INFO L229 MonitoredProcess]: Starting monitored process 9 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 10:39:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 10:39:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:39:31,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:39:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:39:31,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:39:31,486 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:39:31,487 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:39:31,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 10:39:31,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:39:31,692 INFO L407 BasicCegarLoop]: Path program histogram: [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 10:39:31,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:39:31,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:39:31 BoogieIcfgContainer [2024-11-07 10:39:31,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:39:31,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:39:31,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:39:31,859 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:39:31,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:39:06" (3/4) ... [2024-11-07 10:39:31,862 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:39:31,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:39:31,864 INFO L158 Benchmark]: Toolchain (without parser) took 27116.28ms. Allocated memory was 100.7MB in the beginning and 335.5MB in the end (delta: 234.9MB). Free memory was 76.6MB in the beginning and 174.8MB in the end (delta: -98.1MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2024-11-07 10:39:31,864 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:39:31,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.35ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:39:31,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.62ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:39:31,865 INFO L158 Benchmark]: Boogie Preprocessor took 74.30ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 53.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:39:31,865 INFO L158 Benchmark]: RCFGBuilder took 1013.13ms. Allocated memory is still 100.7MB. Free memory was 53.0MB in the beginning and 48.0MB in the end (delta: 5.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2024-11-07 10:39:31,865 INFO L158 Benchmark]: TraceAbstraction took 25586.83ms. Allocated memory was 100.7MB in the beginning and 335.5MB in the end (delta: 234.9MB). Free memory was 47.5MB in the beginning and 174.8MB in the end (delta: -127.3MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2024-11-07 10:39:31,865 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 335.5MB. Free memory was 174.8MB in the beginning and 174.8MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:39:31,866 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.49ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.35ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.62ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.30ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 53.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.13ms. Allocated memory is still 100.7MB. Free memory was 53.0MB in the beginning and 48.0MB in the end (delta: 5.0MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25586.83ms. Allocated memory was 100.7MB in the beginning and 335.5MB in the end (delta: 234.9MB). Free memory was 47.5MB in the beginning and 174.8MB in the end (delta: -127.3MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 335.5MB. Free memory was 174.8MB in the beginning and 174.8MB in the end (delta: 56.4kB). 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 101, overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 25; [L26] unsigned short int var_1_3 = 25; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_4 = 4; [L28] unsigned char var_1_4 = 4; [L29] unsigned char* var_1_4_Pointer = &(var_1_4); [L30] double var_1_8 = 127.625; [L30] double var_1_8 = 127.625; [L31] double* var_1_8_Pointer = &(var_1_8); [L32] double var_1_10 = 0.8; [L32] double var_1_10 = 0.8; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 128.75; [L34] double var_1_11 = 128.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 24.8; [L36] double var_1_12 = 24.8; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] signed short int var_1_14 = -128; [L38] signed short int var_1_14 = -128; [L39] signed short int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = 64; [L40] signed char var_1_15 = 64; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 5; [L42] signed char var_1_16 = 5; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] double var_1_17 = 1.5; [L44] double var_1_17 = 1.5; [L45] double* var_1_17_Pointer = &(var_1_17); [L46] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR \read(var_1_1) [L98] last_1_var_1_1 = var_1_1 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] var_1_3 = __VERIFIER_nondet_ushort() [L83] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] var_1_10 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L93] var_1_16 = __VERIFIER_nondet_char() [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L109] RET updateVariables() [L110] CALL step() [L50] (*(var_1_14_Pointer)) = 200 [L51] EXPR \read(*var_1_16_Pointer) [L51] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L52] EXPR \read(*var_1_10_Pointer) [L52] (*(var_1_17_Pointer)) = (*(var_1_10_Pointer)) [L53] EXPR \read(*var_1_3_Pointer) [L53] EXPR \read(*var_1_4_Pointer) [L53] signed long int stepLocal_0 = (*(var_1_3_Pointer)) / (*(var_1_4_Pointer)); [L54] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L54] COND FALSE !((*(var_1_2_Pointer))) [L57] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L57] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) [L57] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L57] COND TRUE stepLocal_0 >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)))) [L58] EXPR \read(*var_1_4_Pointer) [L58] (*(var_1_1_Pointer)) = (*(var_1_4_Pointer)) [L63] EXPR \read(*var_1_3_Pointer) [L63] EXPR \read(*var_1_1_Pointer) [L63] signed long int stepLocal_2 = (*(var_1_3_Pointer)) + (*(var_1_1_Pointer)); [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L64] EXPR (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_2=3, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L64] signed long int stepLocal_1 = (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)); [L65] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L65] COND FALSE !((*(var_1_15_Pointer)) <= stepLocal_2) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_8_Pointer)) = (*(var_1_10_Pointer)) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L74] COND FALSE !((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) [L101] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR (((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) [L101] EXPR \read(*var_1_15_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) [L101] EXPR \read(*var_1_8_Pointer) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101-L102] return ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2808 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2808 mSDsluCounter, 15164 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11498 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2638 IncrementalHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 3666 mSDtfsCounter, 2638 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1602 GetRequests, 1437 SyntacticMatches, 4 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=19, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1604 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3363 NumberOfCodeBlocks, 3363 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2681 ConstructedInterpolants, 4 QuantifiedInterpolants, 10662 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3548 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4946/5500 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 10:39:31,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_variablewrapping_wrapper-p_file-83.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 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:39:34,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:39:34,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:39:34,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:39:34,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:39:34,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:39:34,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:39:34,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:39:34,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:39:34,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:39:34,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:39:34,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:39:34,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:39:34,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:39:34,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:39:34,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:39:34,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:39:34,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:39:34,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:39:34,575 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 -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2024-11-07 10:39:34,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:39:34,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:39:34,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:39:34,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:39:34,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:39:34,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:36,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:39:36,614 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:39:36,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:36,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf208e11a/f091c0b21aa34a6dbc50caf7ebf5b12f/FLAGb8e0ec6ed [2024-11-07 10:39:36,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf208e11a/f091c0b21aa34a6dbc50caf7ebf5b12f [2024-11-07 10:39:36,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:39:36,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:39:36,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:39:36,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:39:36,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:39:36,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:39:36" (1/1) ... [2024-11-07 10:39:36,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5e8cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:36, skipping insertion in model container [2024-11-07 10:39:36,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:39:36" (1/1) ... [2024-11-07 10:39:36,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:39:37,133 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_variablewrapping_wrapper-p_file-83.i[916,929] [2024-11-07 10:39:37,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:39:37,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:39:37,253 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_variablewrapping_wrapper-p_file-83.i[916,929] [2024-11-07 10:39:37,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:39:37,330 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:39:37,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37 WrapperNode [2024-11-07 10:39:37,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:39:37,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:39:37,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:39:37,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:39:37,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,398 INFO L138 Inliner]: procedures = 33, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-11-07 10:39:37,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:39:37,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:39:37,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:39:37,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:39:37,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,455 INFO L175 MemorySlicer]: Split 130 memory accesses to 13 slices as follows [2, 12, 6, 28, 9, 7, 20, 14, 3, 5, 15, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2024-11-07 10:39:37,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:39:37,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:39:37,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:39:37,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:39:37,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (1/1) ... [2024-11-07 10:39:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:39:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:39:37,545 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 10:39:37,549 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 10:39:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:39:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:39:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:39:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:39:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:39:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:39:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:39:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-07 10:39:37,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:39:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-07 10:39:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-07 10:39:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-07 10:39:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:39:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:39:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:39:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:39:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:39:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:39:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:39:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-07 10:39:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:39:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:39:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:39:37,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-07 10:39:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-07 10:39:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-07 10:39:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-07 10:39:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-07 10:39:37,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:39:37,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:39:39,045 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-07 10:39:39,046 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:39:39,059 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:39:39,060 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:39:39,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:39:39 BoogieIcfgContainer [2024-11-07 10:39:39,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:39:39,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:39:39,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:39:39,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:39:39,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:39:36" (1/3) ... [2024-11-07 10:39:39,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d76882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:39:39, skipping insertion in model container [2024-11-07 10:39:39,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:39:37" (2/3) ... [2024-11-07 10:39:39,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d76882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:39:39, skipping insertion in model container [2024-11-07 10:39:39,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:39:39" (3/3) ... [2024-11-07 10:39:39,074 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2024-11-07 10:39:39,089 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:39:39,089 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:39:39,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:39:39,170 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;@449a9147, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:39:39,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:39:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:39,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:39,186 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:39,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1933956208, now seen corresponding path program 1 times [2024-11-07 10:39:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171421040] [2024-11-07 10:39:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:39,201 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 10:39:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:39,206 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 10:39:39,207 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 10:39:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:39,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:39:39,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-07 10:39:39,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:39,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171421040] [2024-11-07 10:39:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171421040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:39:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126105363] [2024-11-07 10:39:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:39:39,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:39:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:39:39,834 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:39,857 INFO L93 Difference]: Finished difference Result 199 states and 307 transitions. [2024-11-07 10:39:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:39:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-07 10:39:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:39,868 INFO L225 Difference]: With dead ends: 199 [2024-11-07 10:39:39,869 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 10:39:39,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 10:39:39,877 INFO L432 NwaCegarLoop]: 138 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, 138 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 10:39:39,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 10:39:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 10:39:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-11-07 10:39:39,918 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2024-11-07 10:39:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:39,919 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-11-07 10:39:39,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-11-07 10:39:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:39,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:39,923 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:39,938 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 10:39:40,124 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 10:39:40,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 679711970, now seen corresponding path program 1 times [2024-11-07 10:39:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911813705] [2024-11-07 10:39:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:40,126 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 10:39:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:40,129 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 10:39:40,131 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 10:39:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:40,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:39:40,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 10:39:40,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:40,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911813705] [2024-11-07 10:39:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911813705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:40,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:40,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:39:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770981063] [2024-11-07 10:39:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:40,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:40,672 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:40,802 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2024-11-07 10:39:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-07 10:39:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:40,809 INFO L225 Difference]: With dead ends: 197 [2024-11-07 10:39:40,809 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:39:40,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:39:40,811 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:40,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:39:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-07 10:39:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:39:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-11-07 10:39:40,827 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 104 [2024-11-07 10:39:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:40,829 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-11-07 10:39:40,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:39:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-11-07 10:39:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:40,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:40,835 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:40,850 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 10:39:41,035 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 10:39:41,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:41,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1259450076, now seen corresponding path program 1 times [2024-11-07 10:39:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205201479] [2024-11-07 10:39:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:41,037 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 10:39:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:41,041 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 10:39:41,042 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 10:39:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:41,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:39:41,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:41,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:39:41,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:39:41,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 10:39:41,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-07 10:39:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:42,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:42,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205201479] [2024-11-07 10:39:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205201479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:39:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447876219] [2024-11-07 10:39:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:42,029 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:42,960 INFO L93 Difference]: Finished difference Result 387 states and 540 transitions. [2024-11-07 10:39:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:39:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:42,967 INFO L225 Difference]: With dead ends: 387 [2024-11-07 10:39:42,967 INFO L226 Difference]: Without dead ends: 289 [2024-11-07 10:39:42,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:39:42,969 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 264 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:42,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1130 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:39:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-07 10:39:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 147. [2024-11-07 10:39:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.319672131147541) internal successors, (161), 122 states have internal predecessors, (161), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2024-11-07 10:39:43,004 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 104 [2024-11-07 10:39:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2024-11-07 10:39:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2024-11-07 10:39:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:43,007 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:43,022 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 10:39:43,207 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 10:39:43,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:43,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1118901466, now seen corresponding path program 1 times [2024-11-07 10:39:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954971728] [2024-11-07 10:39:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:43,209 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 10:39:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:43,215 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 10:39:43,218 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 10:39:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:43,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:39:43,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:43,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:39:43,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:39:43,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 10:39:44,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-07 10:39:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:44,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:44,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954971728] [2024-11-07 10:39:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954971728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:39:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840939719] [2024-11-07 10:39:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:44,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:44,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:44,211 INFO L87 Difference]: Start difference. First operand 147 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:46,163 INFO L93 Difference]: Finished difference Result 344 states and 478 transitions. [2024-11-07 10:39:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:39:46,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:46,167 INFO L225 Difference]: With dead ends: 344 [2024-11-07 10:39:46,167 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 10:39:46,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:46,169 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 271 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:46,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 621 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:39:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 10:39:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 164. [2024-11-07 10:39:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2024-11-07 10:39:46,194 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 104 [2024-11-07 10:39:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:46,197 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2024-11-07 10:39:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-07 10:39:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:46,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:46,204 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:46,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 10:39:46,404 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 10:39:46,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1587717928, now seen corresponding path program 1 times [2024-11-07 10:39:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303245417] [2024-11-07 10:39:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:46,406 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 10:39:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:46,408 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 10:39:46,409 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 10:39:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:46,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:39:46,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:47,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:39:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:39:47,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:47,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303245417] [2024-11-07 10:39:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303245417] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-07 10:39:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467880019] [2024-11-07 10:39:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:47,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:39:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:39:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:47,740 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:47,941 INFO L93 Difference]: Finished difference Result 263 states and 367 transitions. [2024-11-07 10:39:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:39:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:47,946 INFO L225 Difference]: With dead ends: 263 [2024-11-07 10:39:47,946 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 10:39:47,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:39:47,947 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:47,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:39:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 10:39:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-07 10:39:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-11-07 10:39:47,972 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 104 [2024-11-07 10:39:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:47,972 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-11-07 10:39:47,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-11-07 10:39:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:47,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:47,974 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:47,988 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 10:39:48,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 10:39:48,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:48,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1686181014, now seen corresponding path program 1 times [2024-11-07 10:39:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101035223] [2024-11-07 10:39:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:48,176 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 10:39:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:48,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:39:48,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:39:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:48,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:39:48,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:48,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:48,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101035223] [2024-11-07 10:39:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101035223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:39:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129566348] [2024-11-07 10:39:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:48,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:39:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:39:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:48,581 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:48,628 INFO L93 Difference]: Finished difference Result 269 states and 374 transitions. [2024-11-07 10:39:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:39:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:48,631 INFO L225 Difference]: With dead ends: 269 [2024-11-07 10:39:48,631 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 10:39:48,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:39:48,634 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:48,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:39:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 10:39:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-11-07 10:39:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.3125) internal successors, (189), 144 states have internal predecessors, (189), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2024-11-07 10:39:48,649 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 104 [2024-11-07 10:39:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:48,650 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2024-11-07 10:39:48,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2024-11-07 10:39:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:48,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:48,653 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:48,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:39:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:39:48,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:48,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1006122644, now seen corresponding path program 1 times [2024-11-07 10:39:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629899024] [2024-11-07 10:39:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:48,855 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 10:39:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:48,857 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 10:39:48,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 10:39:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:49,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:39:49,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:49,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:49,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629899024] [2024-11-07 10:39:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629899024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:39:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634857853] [2024-11-07 10:39:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:39:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:39:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:49,287 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:49,354 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2024-11-07 10:39:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:39:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:49,357 INFO L225 Difference]: With dead ends: 275 [2024-11-07 10:39:49,357 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 10:39:49,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:39:49,358 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:49,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 10:39:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2024-11-07 10:39:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 146 states have internal predecessors, (191), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2024-11-07 10:39:49,374 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 104 [2024-11-07 10:39:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:49,374 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2024-11-07 10:39:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2024-11-07 10:39:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:49,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:49,376 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:49,390 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 (8)] Ended with exit code 0 [2024-11-07 10:39:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 10:39:49,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 768884718, now seen corresponding path program 1 times [2024-11-07 10:39:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239713337] [2024-11-07 10:39:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:49,578 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 10:39:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:49,580 INFO L229 MonitoredProcess]: Starting monitored process 9 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 10:39:49,581 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 (9)] Waiting until timeout for monitored process [2024-11-07 10:39:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:49,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:39:49,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:50,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:39:50,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:50,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239713337] [2024-11-07 10:39:50,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239713337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:39:50,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:39:50,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:39:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009375519] [2024-11-07 10:39:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:50,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:39:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:39:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:50,005 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:50,092 INFO L93 Difference]: Finished difference Result 279 states and 383 transitions. [2024-11-07 10:39:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:50,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:50,094 INFO L225 Difference]: With dead ends: 279 [2024-11-07 10:39:50,094 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 10:39:50,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:39:50,095 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:50,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 10:39:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2024-11-07 10:39:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:39:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 237 transitions. [2024-11-07 10:39:50,105 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 237 transitions. Word has length 104 [2024-11-07 10:39:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:50,105 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 237 transitions. [2024-11-07 10:39:50,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 237 transitions. [2024-11-07 10:39:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:50,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:50,107 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 10:39:50,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 10:39:50,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:50,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 770731760, now seen corresponding path program 1 times [2024-11-07 10:39:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836437115] [2024-11-07 10:39:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:50,308 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 10:39:50,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:50,310 INFO L229 MonitoredProcess]: Starting monitored process 10 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 10:39:50,312 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 (10)] Waiting until timeout for monitored process [2024-11-07 10:39:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:50,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:39:50,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:50,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-07 10:39:50,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:39:51,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2024-11-07 10:39:51,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2024-11-07 10:39:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-07 10:39:51,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:51,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-07 10:39:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:51,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836437115] [2024-11-07 10:39:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836437115] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:51,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2024-11-07 10:39:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414048415] [2024-11-07 10:39:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:39:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:39:51,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:39:51,516 INFO L87 Difference]: Start difference. First operand 173 states and 237 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:51,950 INFO L93 Difference]: Finished difference Result 368 states and 497 transitions. [2024-11-07 10:39:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:39:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:51,952 INFO L225 Difference]: With dead ends: 368 [2024-11-07 10:39:51,952 INFO L226 Difference]: Without dead ends: 261 [2024-11-07 10:39:51,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:39:51,953 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 230 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:51,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 833 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:39:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-07 10:39:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-07 10:39:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 227 states have (on average 1.303964757709251) internal successors, (296), 228 states have internal predecessors, (296), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 348 transitions. [2024-11-07 10:39:51,967 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 348 transitions. Word has length 104 [2024-11-07 10:39:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 348 transitions. [2024-11-07 10:39:51,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2024-11-07 10:39:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:39:51,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:51,968 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:51,982 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 (10)] Ended with exit code 0 [2024-11-07 10:39:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 10:39:52,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 636718254, now seen corresponding path program 1 times [2024-11-07 10:39:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:52,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930717600] [2024-11-07 10:39:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:52,170 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 10:39:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:52,173 INFO L229 MonitoredProcess]: Starting monitored process 11 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 10:39:52,174 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 (11)] Waiting until timeout for monitored process [2024-11-07 10:39:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:52,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:39:52,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:52,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:39:52,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:39:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:39:53,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:53,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-07 10:39:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:53,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930717600] [2024-11-07 10:39:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930717600] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:53,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:53,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-07 10:39:53,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203883134] [2024-11-07 10:39:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:53,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:39:53,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:53,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:39:53,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:39:53,523 INFO L87 Difference]: Start difference. First operand 258 states and 348 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:39:53,684 INFO L93 Difference]: Finished difference Result 455 states and 617 transitions. [2024-11-07 10:39:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:39:53,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-07 10:39:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:39:53,688 INFO L225 Difference]: With dead ends: 455 [2024-11-07 10:39:53,688 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 10:39:53,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:39:53,689 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 25 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:39:53,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:39:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 10:39:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 259. [2024-11-07 10:39:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 229 states have internal predecessors, (296), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:39:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 348 transitions. [2024-11-07 10:39:53,703 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 348 transitions. Word has length 104 [2024-11-07 10:39:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:39:53,703 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 348 transitions. [2024-11-07 10:39:53,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:39:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-07 10:39:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:39:53,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:39:53,705 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:53,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 10:39:53,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 10:39:53,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:39:53,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:39:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1411815602, now seen corresponding path program 1 times [2024-11-07 10:39:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:39:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879417928] [2024-11-07 10:39:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:39:53,907 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 10:39:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:39:53,909 INFO L229 MonitoredProcess]: Starting monitored process 12 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 10:39:53,910 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 (12)] Waiting until timeout for monitored process [2024-11-07 10:39:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:39:54,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:39:54,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:39:54,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:39:55,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:39:55,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-07 10:39:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:39:55,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:39:57,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-11-07 10:39:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:39:57,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:39:57,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879417928] [2024-11-07 10:39:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879417928] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:39:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:39:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-11-07 10:39:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998920287] [2024-11-07 10:39:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:39:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:39:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:39:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:39:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:39:57,993 INFO L87 Difference]: Start difference. First operand 259 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:40:03,322 INFO L93 Difference]: Finished difference Result 551 states and 741 transitions. [2024-11-07 10:40:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:40:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-07 10:40:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:40:03,338 INFO L225 Difference]: With dead ends: 551 [2024-11-07 10:40:03,338 INFO L226 Difference]: Without dead ends: 373 [2024-11-07 10:40:03,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:40:03,340 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:40:03,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 710 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 10:40:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-07 10:40:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 283. [2024-11-07 10:40:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 252 states have (on average 1.3253968253968254) internal successors, (334), 253 states have internal predecessors, (334), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:40:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 386 transitions. [2024-11-07 10:40:03,355 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 386 transitions. Word has length 105 [2024-11-07 10:40:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:40:03,355 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 386 transitions. [2024-11-07 10:40:03,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 386 transitions. [2024-11-07 10:40:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:40:03,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:40:03,357 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:03,375 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 (12)] Ended with exit code 0 [2024-11-07 10:40:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 10:40:03,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:40:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:40:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1721534730, now seen corresponding path program 1 times [2024-11-07 10:40:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:40:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704743665] [2024-11-07 10:40:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:40:03,559 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 10:40:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:40:03,561 INFO L229 MonitoredProcess]: Starting monitored process 13 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 10:40:03,562 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 (13)] Waiting until timeout for monitored process [2024-11-07 10:40:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:40:03,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:40:03,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:40:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:40:04,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-07 10:40:04,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:40:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-07 10:40:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:40:05,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:40:05,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-07 10:40:06,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-07 10:40:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:40:06,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:40:06,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704743665] [2024-11-07 10:40:06,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704743665] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:40:06,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:40:06,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-07 10:40:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304506442] [2024-11-07 10:40:06,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:40:06,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:40:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:40:06,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:40:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:40:06,155 INFO L87 Difference]: Start difference. First operand 283 states and 386 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:40:07,539 INFO L93 Difference]: Finished difference Result 473 states and 645 transitions. [2024-11-07 10:40:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:40:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-07 10:40:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:40:07,546 INFO L225 Difference]: With dead ends: 473 [2024-11-07 10:40:07,546 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 10:40:07,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:40:07,547 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:40:07,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 545 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:40:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 10:40:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-07 10:40:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.3067226890756303) internal successors, (311), 239 states have internal predecessors, (311), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:40:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 363 transitions. [2024-11-07 10:40:07,559 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 363 transitions. Word has length 105 [2024-11-07 10:40:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:40:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 363 transitions. [2024-11-07 10:40:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 363 transitions. [2024-11-07 10:40:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:40:07,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:40:07,561 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:07,578 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 (13)] Ended with exit code 0 [2024-11-07 10:40:07,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 10:40:07,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:40:07,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:40:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1473855216, now seen corresponding path program 1 times [2024-11-07 10:40:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:40:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837646412] [2024-11-07 10:40:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:40:07,763 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 10:40:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:40:07,765 INFO L229 MonitoredProcess]: Starting monitored process 14 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 10:40:07,766 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 (14)] Waiting until timeout for monitored process [2024-11-07 10:40:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:40:08,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:40:08,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:40:08,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:40:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:40:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:40:08,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:40:08,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:40:08,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837646412] [2024-11-07 10:40:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837646412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:40:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:40:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:40:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588254689] [2024-11-07 10:40:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:40:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:40:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:40:08,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:40:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:40:08,596 INFO L87 Difference]: Start difference. First operand 269 states and 363 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:40:09,994 INFO L93 Difference]: Finished difference Result 624 states and 839 transitions. [2024-11-07 10:40:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:40:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-07 10:40:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:40:09,999 INFO L225 Difference]: With dead ends: 624 [2024-11-07 10:40:09,999 INFO L226 Difference]: Without dead ends: 434 [2024-11-07 10:40:10,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:40:10,001 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 277 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:40:10,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 652 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:40:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-07 10:40:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 272. [2024-11-07 10:40:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 242 states have internal predecessors, (316), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:40:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 368 transitions. [2024-11-07 10:40:10,020 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 368 transitions. Word has length 105 [2024-11-07 10:40:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:40:10,020 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 368 transitions. [2024-11-07 10:40:10,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:40:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 368 transitions. [2024-11-07 10:40:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:40:10,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:40:10,021 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:10,034 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 (14)] Ended with exit code 0 [2024-11-07 10:40:10,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 10:40:10,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:40:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:40:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash -494097669, now seen corresponding path program 1 times [2024-11-07 10:40:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:40:10,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559797698] [2024-11-07 10:40:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:40:10,223 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 10:40:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:40:10,227 INFO L229 MonitoredProcess]: Starting monitored process 15 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 10:40:10,228 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 (15)] Waiting until timeout for monitored process [2024-11-07 10:40:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:40:10,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:40:10,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:40:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-07 10:40:12,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:40:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 133 [2024-11-07 10:40:12,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:40:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 138 [2024-11-07 10:40:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-07 10:40:12,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:40:13,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:40:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559797698] [2024-11-07 10:40:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559797698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:40:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1120738017] [2024-11-07 10:40:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:40:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:40:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:40:13,106 INFO L229 MonitoredProcess]: Starting monitored process 16 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 10:40:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-07 10:40:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:40:14,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:40:14,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:40:15,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8