./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79'] 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-s_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:42:14,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:42:14,460 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:42:14,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:42:14,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:42:14,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:42:14,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:42:14,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:42:14,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:42:14,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:42:14,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:42:14,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:42:14,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:42:14,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:42:14,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:42:14,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:42:14,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:42:14,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:42:14,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:14,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:42:14,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:42:14,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:42:14,499 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-11-07 10:42:14,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:42:14,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:42:14,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:42:14,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:42:14,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:42:14,741 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-s_file-17.i [2024-11-07 10:42:15,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:42:16,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:42:16,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-07 10:42:16,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cda5bfc0/6faa5aa36e704a7194d9379f1a29b1a0/FLAG564e22a32 [2024-11-07 10:42:16,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cda5bfc0/6faa5aa36e704a7194d9379f1a29b1a0 [2024-11-07 10:42:16,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:42:16,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:42:16,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:16,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:42:16,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:42:16,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@780af174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16, skipping insertion in model container [2024-11-07 10:42:16,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:42:16,513 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-s_file-17.i[916,929] [2024-11-07 10:42:16,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:16,564 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:42:16,572 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-s_file-17.i[916,929] [2024-11-07 10:42:16,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:16,622 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:42:16,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16 WrapperNode [2024-11-07 10:42:16,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:16,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:16,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:42:16,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:42:16,629 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:42:16" (1/1) ... [2024-11-07 10:42:16,638 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:42:16" (1/1) ... [2024-11-07 10:42:16,671 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 618 [2024-11-07 10:42:16,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:16,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:42:16,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:42:16,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:42:16,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,688 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:42:16,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:42:16,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:42:16,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:42:16,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:42:16,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (1/1) ... [2024-11-07 10:42:16,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:16,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:42:16,766 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:42:16,768 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:42:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:42:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:42:16,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:42:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:42:16,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:42:16,901 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:42:16,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:42:17,497 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-11-07 10:42:17,497 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:42:17,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:42:17,510 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:42:17,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:17 BoogieIcfgContainer [2024-11-07 10:42:17,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:42:17,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:42:17,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:42:17,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:42:17,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:16" (1/3) ... [2024-11-07 10:42:17,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:17, skipping insertion in model container [2024-11-07 10:42:17,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:16" (2/3) ... [2024-11-07 10:42:17,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:17, skipping insertion in model container [2024-11-07 10:42:17,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:17" (3/3) ... [2024-11-07 10:42:17,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-11-07 10:42:17,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:42:17,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:42:17,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:42:17,583 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;@72ca706b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:42:17,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:42:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:17,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:17,599 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:17,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:17,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash 37068822, now seen corresponding path program 1 times [2024-11-07 10:42:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559990809] [2024-11-07 10:42:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559990809] [2024-11-07 10:42:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559990809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:42:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369844266] [2024-11-07 10:42:17,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:17,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:42:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:42:18,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:42:18,007 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:18,029 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-07 10:42:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:42:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:42:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:18,038 INFO L225 Difference]: With dead ends: 281 [2024-11-07 10:42:18,038 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 10:42:18,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:42:18,044 INFO L432 NwaCegarLoop]: 207 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, 207 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:42:18,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 10:42:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 10:42:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-07 10:42:18,082 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-07 10:42:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-07 10:42:18,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-07 10:42:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:18,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:18,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:42:18,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:18,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash 332968922, now seen corresponding path program 1 times [2024-11-07 10:42:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255853773] [2024-11-07 10:42:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255853773] [2024-11-07 10:42:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255853773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:18,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:42:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516521019] [2024-11-07 10:42:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:42:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:42:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:42:18,428 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:18,472 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-07 10:42:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:42:18,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:42:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:18,474 INFO L225 Difference]: With dead ends: 279 [2024-11-07 10:42:18,474 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 10:42:18,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:42:18,475 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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:42:18,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 10:42:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 10:42:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-07 10:42:18,487 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-07 10:42:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-07 10:42:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-07 10:42:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:18,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:18,490 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:42:18,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:18,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1327662620, now seen corresponding path program 1 times [2024-11-07 10:42:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538743019] [2024-11-07 10:42:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538743019] [2024-11-07 10:42:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538743019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:42:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019335977] [2024-11-07 10:42:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:42:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:42:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:42:18,765 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:18,798 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-07 10:42:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:42:18,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-07 10:42:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:18,799 INFO L225 Difference]: With dead ends: 283 [2024-11-07 10:42:18,799 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 10:42:18,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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:42:18,801 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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:42:18,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 10:42:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-07 10:42:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-07 10:42:18,809 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-07 10:42:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:18,810 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-07 10:42:18,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-07 10:42:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:42:18,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:18,813 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:42:18,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1021693129, now seen corresponding path program 1 times [2024-11-07 10:42:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282530382] [2024-11-07 10:42:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282530382] [2024-11-07 10:42:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282530382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:18,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:42:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011114411] [2024-11-07 10:42:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:42:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:42:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:42:18,983 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:19,010 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-07 10:42:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:42:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:42:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:19,013 INFO L225 Difference]: With dead ends: 288 [2024-11-07 10:42:19,013 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 10:42:19,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:42:19,014 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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:42:19,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 10:42:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-07 10:42:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-07 10:42:19,027 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 143 [2024-11-07 10:42:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:19,027 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-07 10:42:19,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-07 10:42:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:42:19,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:19,030 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:42:19,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash -341634759, now seen corresponding path program 1 times [2024-11-07 10:42:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:19,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962192839] [2024-11-07 10:42:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962192839] [2024-11-07 10:42:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962192839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:42:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911885405] [2024-11-07 10:42:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:20,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:20,363 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:20,733 INFO L93 Difference]: Finished difference Result 351 states and 513 transitions. [2024-11-07 10:42:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:42:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-07 10:42:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:20,737 INFO L225 Difference]: With dead ends: 351 [2024-11-07 10:42:20,737 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:42:20,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:20,738 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 166 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:20,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 520 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:42:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:42:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2024-11-07 10:42:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.429530201342282) internal successors, (213), 149 states have internal predecessors, (213), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-11-07 10:42:20,745 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 143 [2024-11-07 10:42:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-11-07 10:42:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-11-07 10:42:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:42:20,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:20,748 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:20,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:42:20,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:20,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2068519753, now seen corresponding path program 1 times [2024-11-07 10:42:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966738275] [2024-11-07 10:42:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966738275] [2024-11-07 10:42:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966738275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:42:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411084520] [2024-11-07 10:42:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:42:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:42:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:42:21,177 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:21,442 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2024-11-07 10:42:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:42:21,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:42:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:21,444 INFO L225 Difference]: With dead ends: 334 [2024-11-07 10:42:21,444 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 10:42:21,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:21,448 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 84 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:21,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:42:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 10:42:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-11-07 10:42:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 151 states have (on average 1.423841059602649) internal successors, (215), 151 states have internal predecessors, (215), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2024-11-07 10:42:21,462 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 143 [2024-11-07 10:42:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2024-11-07 10:42:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2024-11-07 10:42:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:42:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:21,466 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:42:21,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1388461383, now seen corresponding path program 1 times [2024-11-07 10:42:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039057321] [2024-11-07 10:42:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:42:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:42:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:42:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:42:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:42:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:42:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:42:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:42:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:42:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:42:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:42:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:42:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039057321] [2024-11-07 10:42:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039057321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:42:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224705906] [2024-11-07 10:42:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:22,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:42:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:42:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:22,848 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:23,515 INFO L93 Difference]: Finished difference Result 670 states and 983 transitions. [2024-11-07 10:42:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:42:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-07 10:42:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:23,519 INFO L225 Difference]: With dead ends: 670 [2024-11-07 10:42:23,520 INFO L226 Difference]: Without dead ends: 504 [2024-11-07 10:42:23,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:42:23,521 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 322 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:23,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 944 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:42:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-07 10:42:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2024-11-07 10:42:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 446 states have (on average 1.4260089686098654) internal successors, (636), 446 states have internal predecessors, (636), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:42:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 732 transitions. [2024-11-07 10:42:23,557 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 732 transitions. Word has length 143 [2024-11-07 10:42:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:23,557 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 732 transitions. [2024-11-07 10:42:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 732 transitions. [2024-11-07 10:42:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:42:23,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:23,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:23,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:42:23,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1947047509, now seen corresponding path program 1 times [2024-11-07 10:42:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403205659] [2024-11-07 10:42:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:42:23,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:42:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:42:23,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:42:23,727 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:42:23,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:42:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:42:23,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:42:23,779 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:42:23,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:42:23 BoogieIcfgContainer [2024-11-07 10:42:23,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:42:23,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:42:23,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:42:23,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:42:23,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:17" (3/4) ... [2024-11-07 10:42:23,787 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:42:23,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:42:23,789 INFO L158 Benchmark]: Toolchain (without parser) took 7389.96ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 91.2MB in the beginning and 317.0MB in the end (delta: -225.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,790 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:42:23,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.13ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 73.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.64ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 69.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,790 INFO L158 Benchmark]: Boogie Preprocessor took 57.61ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:42:23,790 INFO L158 Benchmark]: RCFGBuilder took 775.93ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 72.7MB in the end (delta: -7.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,791 INFO L158 Benchmark]: TraceAbstraction took 6271.88ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 72.5MB in the beginning and 317.1MB in the end (delta: -244.7MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,791 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 394.3MB. Free memory was 317.1MB in the beginning and 317.0MB in the end (delta: 101.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:42:23,792 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.55ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.13ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 73.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.64ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 69.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.61ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 775.93ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 72.7MB in the end (delta: -7.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6271.88ms. Allocated memory was 117.4MB in the beginning and 394.3MB in the end (delta: 276.8MB). Free memory was 72.5MB in the beginning and 317.1MB in the end (delta: -244.7MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 394.3MB. Free memory was 317.1MB in the beginning and 317.0MB in the end (delta: 101.3kB). Peak memory consumption was 8.4MB. 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 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_15 [L121] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] RET updateVariables() [L133] CALL step() [L63] WrapperStruct00.var_1_12 = last_1_WrapperStruct00_var_1_15 [L64] EXPR WrapperStruct00.var_1_12 [L64] unsigned long int stepLocal_1 = WrapperStruct00.var_1_12; [L65] EXPR WrapperStruct00.var_1_9 [L65] signed short int stepLocal_0 = WrapperStruct00.var_1_9; [L66] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=16383, stepLocal_1=16] [L66] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_10) [L73] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L73] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L76] COND FALSE !((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) [L79] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L79] COND FALSE !(WrapperStruct00.var_1_2) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_15 [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_8 [L87] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L87] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124-L125] return ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 3983 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2667 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1424 IncrementalHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1316 mSDtfsCounter, 1424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 1941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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:42:23,818 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-s_file-17.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:42:25,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:42:25,588 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:42:25,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:42:25,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:42:25,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:42:25,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:42:25,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:42:25,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:42:25,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:42:25,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:42:25,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:42:25,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:42:25,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:42:25,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:42:25,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:42:25,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:42:25,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:42:25,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:25,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:42:25,616 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:42:25,617 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:42:25,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:42:25,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:42:25,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:42:25,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:42:25,617 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-11-07 10:42:25,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:42:25,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:42:25,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:42:25,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:42:25,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:42:25,848 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-s_file-17.i [2024-11-07 10:42:26,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:42:27,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:42:27,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-07 10:42:27,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f95d84d4/44963dd9569247bf9298a4e3baa4ac62/FLAG46284db8b [2024-11-07 10:42:27,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f95d84d4/44963dd9569247bf9298a4e3baa4ac62 [2024-11-07 10:42:27,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:42:27,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:42:27,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:27,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:42:27,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:42:27,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef1014e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27, skipping insertion in model container [2024-11-07 10:42:27,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:42:27,647 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-s_file-17.i[916,929] [2024-11-07 10:42:27,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:27,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:42:27,698 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-s_file-17.i[916,929] [2024-11-07 10:42:27,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:27,757 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:42:27,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27 WrapperNode [2024-11-07 10:42:27,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:27,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:27,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:42:27,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:42:27,765 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:42:27" (1/1) ... [2024-11-07 10:42:27,779 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:42:27" (1/1) ... [2024-11-07 10:42:27,818 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 615 [2024-11-07 10:42:27,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:27,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:42:27,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:42:27,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:42:27,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,865 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-07 10:42:27,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:42:27,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:42:27,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:42:27,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:42:27,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (1/1) ... [2024-11-07 10:42:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:42:27,938 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:42:27,942 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:42:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:42:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:42:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:42:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:42:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:42:27,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:42:27,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:42:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:42:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:42:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:42:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:42:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:42:28,078 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:42:28,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:42:34,072 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-07 10:42:34,072 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:42:34,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:42:34,082 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:42:34,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:34 BoogieIcfgContainer [2024-11-07 10:42:34,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:42:34,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:42:34,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:42:34,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:42:34,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:27" (1/3) ... [2024-11-07 10:42:34,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:34, skipping insertion in model container [2024-11-07 10:42:34,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:27" (2/3) ... [2024-11-07 10:42:34,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:34, skipping insertion in model container [2024-11-07 10:42:34,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:34" (3/3) ... [2024-11-07 10:42:34,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-11-07 10:42:34,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:42:34,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:42:34,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:42:34,145 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;@20e41a24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:42:34,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:42:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:34,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:34,156 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:34,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:34,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 220380826, now seen corresponding path program 1 times [2024-11-07 10:42:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081633709] [2024-11-07 10:42:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:34,169 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:42:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:34,171 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:42:34,173 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:42:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:34,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:42:34,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-07 10:42:34,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:34,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081633709] [2024-11-07 10:42:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081633709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:42:34,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927597257] [2024-11-07 10:42:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:42:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:42:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:42:34,651 INFO L87 Difference]: Start difference. First operand has 144 states, 125 states have (on average 1.456) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:34,676 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-07 10:42:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:42:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:42:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:34,683 INFO L225 Difference]: With dead ends: 281 [2024-11-07 10:42:34,684 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 10:42:34,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:42:34,687 INFO L432 NwaCegarLoop]: 207 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, 207 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:42:34,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 10:42:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 10:42:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2024-11-07 10:42:34,718 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2024-11-07 10:42:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:34,718 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2024-11-07 10:42:34,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2024-11-07 10:42:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:34,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:34,724 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:34,737 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:42:34,925 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:42:34,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash 516280926, now seen corresponding path program 1 times [2024-11-07 10:42:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002172177] [2024-11-07 10:42:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:34,926 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:42:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:34,929 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:42:34,930 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:42:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:35,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:42:35,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-07 10:42:35,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:35,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002172177] [2024-11-07 10:42:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002172177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:42:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394317364] [2024-11-07 10:42:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:42:35,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:42:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:42:35,376 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:35,470 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2024-11-07 10:42:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:42:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-07 10:42:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:35,471 INFO L225 Difference]: With dead ends: 279 [2024-11-07 10:42:35,472 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 10:42:35,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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:42:35,473 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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:42:35,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:42:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 10:42:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-07 10:42:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-07 10:42:35,482 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2024-11-07 10:42:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:35,483 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-07 10:42:35,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-07 10:42:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:42:35,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:35,489 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:35,503 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:42:35,690 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:42:35,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -430756960, now seen corresponding path program 1 times [2024-11-07 10:42:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169325443] [2024-11-07 10:42:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:35,691 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:42:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:35,694 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:42:35,695 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:42:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:36,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:42:36,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:36,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:36,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169325443] [2024-11-07 10:42:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169325443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:36,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:42:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71028696] [2024-11-07 10:42:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:36,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:42:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:42:36,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:42:36,139 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:36,324 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-07 10:42:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:42:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-07 10:42:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:36,326 INFO L225 Difference]: With dead ends: 283 [2024-11-07 10:42:36,326 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 10:42:36,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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:42:36,327 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:36,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:42:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 10:42:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-07 10:42:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-07 10:42:36,338 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2024-11-07 10:42:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-07 10:42:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:42:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-07 10:42:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:42:36,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:36,340 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:36,354 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:42:36,541 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:42:36,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash 307378747, now seen corresponding path program 1 times [2024-11-07 10:42:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599318611] [2024-11-07 10:42:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:36,542 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:42:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:36,545 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:42:36,550 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:42:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:37,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:42:37,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:37,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:37,159 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 173 treesize of output 65 [2024-11-07 10:42:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-07 10:42:37,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:37,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599318611] [2024-11-07 10:42:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599318611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:42:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765755369] [2024-11-07 10:42:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:37,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:37,191 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:40,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:42:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:43,563 INFO L93 Difference]: Finished difference Result 286 states and 420 transitions. [2024-11-07 10:42:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:42:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-07 10:42:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:43,564 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:42:43,564 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:42:43,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:42:43,565 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 175 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:43,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-07 10:42:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:42:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:42:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-07 10:42:43,571 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 143 [2024-11-07 10:42:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-07 10:42:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-07 10:42:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 10:42:43,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:43,572 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:42:43,773 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:42:43,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -161609983, now seen corresponding path program 1 times [2024-11-07 10:42:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852168798] [2024-11-07 10:42:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:43,774 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:42:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:43,776 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:42:43,776 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:42:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:42:44,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:44,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:44,397 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 173 treesize of output 65 [2024-11-07 10:42:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-07 10:42:44,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:44,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852168798] [2024-11-07 10:42:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852168798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:42:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651907503] [2024-11-07 10:42:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:44,431 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:46,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:42:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:49,540 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2024-11-07 10:42:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:42:49,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-07 10:42:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:49,543 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:42:49,543 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:42:49,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:42:49,544 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:49,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 10:42:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:42:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:42:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-11-07 10:42:49,564 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 145 [2024-11-07 10:42:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-11-07 10:42:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-11-07 10:42:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:42:49,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:49,565 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,582 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:42:49,765 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:42:49,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1042688005, now seen corresponding path program 1 times [2024-11-07 10:42:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752342687] [2024-11-07 10:42:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:49,766 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:42:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:49,768 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:42:49,769 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:42:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:42:50,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:50,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:50,457 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 173 treesize of output 65 [2024-11-07 10:42:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 10:42:50,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:50,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752342687] [2024-11-07 10:42:50,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752342687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:50,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:50,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:42:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732144310] [2024-11-07 10:42:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:50,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:50,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:50,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:50,493 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:53,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:42:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:56,646 INFO L93 Difference]: Finished difference Result 286 states and 416 transitions. [2024-11-07 10:42:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:42:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2024-11-07 10:42:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:56,648 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:42:56,648 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:42:56,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:42:56,649 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 138 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:56,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 494 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-07 10:42:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:42:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-07 10:42:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:42:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-07 10:42:56,654 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 147 [2024-11-07 10:42:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-07 10:42:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:42:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-07 10:42:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:42:56,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:56,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,673 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:42:56,856 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:42:56,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1669517631, now seen corresponding path program 1 times [2024-11-07 10:42:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:42:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682978048] [2024-11-07 10:42:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:56,857 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:42:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:42:56,859 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:42:56,860 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:42:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:42:57,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:57,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:42:57,552 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 20 treesize of output 21 [2024-11-07 10:42:57,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:57,591 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 31 treesize of output 13 [2024-11-07 10:42:57,789 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 14 treesize of output 10 [2024-11-07 10:42:57,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:57,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 42 [2024-11-07 10:42:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:42:57,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:42:57,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:42:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682978048] [2024-11-07 10:42:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682978048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:57,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:42:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522642446] [2024-11-07 10:42:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:42:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:42:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:42:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:42:58,000 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:43:00,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:43:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:06,214 INFO L93 Difference]: Finished difference Result 496 states and 716 transitions. [2024-11-07 10:43:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:43:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-07 10:43:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:06,220 INFO L225 Difference]: With dead ends: 496 [2024-11-07 10:43:06,220 INFO L226 Difference]: Without dead ends: 355 [2024-11-07 10:43:06,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:43:06,220 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 323 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:06,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 741 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-07 10:43:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-07 10:43:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 262. [2024-11-07 10:43:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 226 states have (on average 1.3849557522123894) internal successors, (313), 226 states have internal predecessors, (313), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:43:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 377 transitions. [2024-11-07 10:43:06,237 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 377 transitions. Word has length 149 [2024-11-07 10:43:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:06,238 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 377 transitions. [2024-11-07 10:43:06,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:43:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 377 transitions. [2024-11-07 10:43:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:43:06,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:06,239 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,261 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:43:06,439 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:43:06,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:06,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash -989459261, now seen corresponding path program 1 times [2024-11-07 10:43:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:06,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166575251] [2024-11-07 10:43:06,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:06,440 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:43:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:06,443 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:43:06,444 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:43:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:06,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:43:06,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:06,935 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 35 treesize of output 29 [2024-11-07 10:43:06,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:06,972 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 108 treesize of output 54 [2024-11-07 10:43:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:43:07,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:07,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166575251] [2024-11-07 10:43:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166575251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:07,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:43:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387721208] [2024-11-07 10:43:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:43:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:07,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:43:07,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:43:07,002 INFO L87 Difference]: Start difference. First operand 262 states and 377 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:43:10,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:43:15,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:43:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:16,607 INFO L93 Difference]: Finished difference Result 583 states and 843 transitions. [2024-11-07 10:43:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:43:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2024-11-07 10:43:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:16,612 INFO L225 Difference]: With dead ends: 583 [2024-11-07 10:43:16,612 INFO L226 Difference]: Without dead ends: 442 [2024-11-07 10:43:16,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:43:16,613 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 179 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:16,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 994 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-07 10:43:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-07 10:43:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-07 10:43:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 387 states have (on average 1.392764857881137) internal successors, (539), 387 states have internal predecessors, (539), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:43:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 635 transitions. [2024-11-07 10:43:16,631 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 635 transitions. Word has length 149 [2024-11-07 10:43:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:16,631 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 635 transitions. [2024-11-07 10:43:16,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:43:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 635 transitions. [2024-11-07 10:43:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:43:16,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:16,632 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:43:16,832 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:43:16,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 57367363, now seen corresponding path program 1 times [2024-11-07 10:43:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357374894] [2024-11-07 10:43:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:16,834 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:43:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:16,836 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:43:16,836 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:43:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:17,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 10:43:17,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:17,612 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 8 treesize of output 1 [2024-11-07 10:43:17,657 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 42 treesize of output 15 [2024-11-07 10:43:17,682 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 42 treesize of output 15 [2024-11-07 10:43:17,703 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 32 treesize of output 35 [2024-11-07 10:43:20,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:20,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 51 [2024-11-07 10:43:25,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:25,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 64 [2024-11-07 10:43:34,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:34,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-11-07 10:43:34,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:34,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-07 10:43:34,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:34,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2024-11-07 10:43:35,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:35,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 113 [2024-11-07 10:43:38,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:38,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 119 [2024-11-07 10:43:38,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:38,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 106 treesize of output 129 [2024-11-07 10:43:39,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:39,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 136 treesize of output 159 [2024-11-07 10:43:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 393 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 10:43:39,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:43:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:43:47,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357374894] [2024-11-07 10:43:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357374894] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:43:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:43:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2024-11-07 10:43:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498713528] [2024-11-07 10:43:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:43:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:43:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=237, Unknown=10, NotChecked=0, Total=342 [2024-11-07 10:43:47,765 INFO L87 Difference]: Start difference. First operand 440 states and 635 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)