./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.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-65.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', '2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac'] 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-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:47:38,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:47:39,029 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:47:39,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:47:39,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:47:39,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:47:39,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:47:39,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:47:39,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:47:39,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:47:39,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:47:39,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:47:39,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:47:39,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:47:39,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:47:39,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:47:39,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:47:39,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:47:39,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:47:39,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:47:39,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:39,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:47:39,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:47:39,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:47:39,065 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2024-11-07 10:47:39,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:47:39,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:47:39,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:47:39,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:47:39,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:47:39,353 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-65.i [2024-11-07 10:47:40,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:47:40,817 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:47:40,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2024-11-07 10:47:40,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7219d40df/70b0c856715f493891e7ff67444cd5ee/FLAG4a8756c35 [2024-11-07 10:47:40,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7219d40df/70b0c856715f493891e7ff67444cd5ee [2024-11-07 10:47:40,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:47:40,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:47:40,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:40,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:47:40,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:47:40,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:40" (1/1) ... [2024-11-07 10:47:40,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d0da70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:40, skipping insertion in model container [2024-11-07 10:47:40,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:40" (1/1) ... [2024-11-07 10:47:40,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:47:41,017 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-65.i[916,929] [2024-11-07 10:47:41,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:41,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:47:41,099 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-65.i[916,929] [2024-11-07 10:47:41,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:41,165 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:47:41,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41 WrapperNode [2024-11-07 10:47:41,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:41,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:41,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:47:41,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:47:41,173 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:47:41" (1/1) ... [2024-11-07 10:47:41,190 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:47:41" (1/1) ... [2024-11-07 10:47:41,252 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2024-11-07 10:47:41,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:41,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:47:41,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:47:41,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:47:41,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,284 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:47:41,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:47:41,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:47:41,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:47:41,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:47:41,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (1/1) ... [2024-11-07 10:47:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:47:41,377 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:47:41,383 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:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:47:41,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:47:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:47:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:47:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:47:41,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:47:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:47:41,519 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:47:41,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:47:42,110 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-07 10:47:42,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:47:42,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:47:42,122 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:47:42,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:42 BoogieIcfgContainer [2024-11-07 10:47:42,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:47:42,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:47:42,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:47:42,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:47:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:47:40" (1/3) ... [2024-11-07 10:47:42,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a592e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:42, skipping insertion in model container [2024-11-07 10:47:42,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:41" (2/3) ... [2024-11-07 10:47:42,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a592e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:42, skipping insertion in model container [2024-11-07 10:47:42,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:42" (3/3) ... [2024-11-07 10:47:42,131 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2024-11-07 10:47:42,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:47:42,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:47:42,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:47:42,198 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;@e2fd2b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:47:42,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:47:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:42,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:42,214 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:42,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:42,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1229666287, now seen corresponding path program 1 times [2024-11-07 10:47:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655123826] [2024-11-07 10:47:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:47:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:47:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:47:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:47:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:47:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:47:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655123826] [2024-11-07 10:47:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655123826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:47:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078216582] [2024-11-07 10:47:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:47:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:47:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:42,889 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:42,966 INFO L93 Difference]: Finished difference Result 221 states and 340 transitions. [2024-11-07 10:47:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:47:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-07 10:47:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:42,977 INFO L225 Difference]: With dead ends: 221 [2024-11-07 10:47:42,978 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:47:42,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:42,986 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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:47:42,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:47:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 10:47:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-07 10:47:43,034 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-07 10:47:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:43,036 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-07 10:47:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-07 10:47:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:43,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:43,043 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:43,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:47:43,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:43,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 668966509, now seen corresponding path program 1 times [2024-11-07 10:47:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:43,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138890289] [2024-11-07 10:47:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:47:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:47:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:47:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:47:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:47:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:47:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:43,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138890289] [2024-11-07 10:47:43,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138890289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:43,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:47:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005989973] [2024-11-07 10:47:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:43,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:47:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:47:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:43,453 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:43,511 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-07 10:47:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:47:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:47:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:43,514 INFO L225 Difference]: With dead ends: 222 [2024-11-07 10:47:43,515 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:47:43,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:43,516 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:43,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:47:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 10:47:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-07 10:47:43,531 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2024-11-07 10:47:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:43,533 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-07 10:47:43,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-07 10:47:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:43,536 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:47:43,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:43,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2043589665, now seen corresponding path program 1 times [2024-11-07 10:47:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:43,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859446394] [2024-11-07 10:47:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:47:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:47:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:47:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:47:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:47:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:47:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:43,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859446394] [2024-11-07 10:47:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859446394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:47:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212392789] [2024-11-07 10:47:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:43,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:47:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:47:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:43,760 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:43,799 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2024-11-07 10:47:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:47:43,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:47:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:43,802 INFO L225 Difference]: With dead ends: 228 [2024-11-07 10:47:43,804 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 10:47:43,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:43,806 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 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:47:43,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 10:47:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-07 10:47:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-07 10:47:43,818 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 112 [2024-11-07 10:47:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:43,819 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-07 10:47:43,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-07 10:47:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:43,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:43,823 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:43,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:47:43,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1363531295, now seen corresponding path program 1 times [2024-11-07 10:47:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116951286] [2024-11-07 10:47:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:47:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:47:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:47:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:47:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:47:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:47:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116951286] [2024-11-07 10:47:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116951286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:47:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131767110] [2024-11-07 10:47:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:47:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:47:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:44,058 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:44,087 INFO L93 Difference]: Finished difference Result 232 states and 329 transitions. [2024-11-07 10:47:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:47:44,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:47:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:44,090 INFO L225 Difference]: With dead ends: 232 [2024-11-07 10:47:44,090 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:47:44,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:44,091 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:44,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:47:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-07 10:47:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-07 10:47:44,102 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 112 [2024-11-07 10:47:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-07 10:47:44,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-07 10:47:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:44,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:44,105 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:44,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:47:44,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:44,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash 411476067, now seen corresponding path program 1 times [2024-11-07 10:47:44,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:44,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280362395] [2024-11-07 10:47:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:47:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:47:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:47:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:47:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:47:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:47:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:47:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:47:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:47:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:47:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:47:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:47:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280362395] [2024-11-07 10:47:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280362395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:47:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667976723] [2024-11-07 10:47:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:47:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:47:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:47:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:44,317 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:44,366 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2024-11-07 10:47:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:47:44,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:47:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:44,368 INFO L225 Difference]: With dead ends: 236 [2024-11-07 10:47:44,369 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 10:47:44,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:44,370 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:44,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 597 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 10:47:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-07 10:47:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-07 10:47:44,385 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 112 [2024-11-07 10:47:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:44,386 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-07 10:47:44,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-07 10:47:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:44,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:44,387 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:47:44,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 413323109, now seen corresponding path program 1 times [2024-11-07 10:47:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:47:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060696332] [2024-11-07 10:47:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:47:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:47:44,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:47:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:47:44,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:47:44,573 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:47:44,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:47:44,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:47:44,579 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 10:47:44,644 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:47:44,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:47:44 BoogieIcfgContainer [2024-11-07 10:47:44,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:47:44,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:47:44,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:47:44,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:47:44,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:42" (3/4) ... [2024-11-07 10:47:44,654 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:47:44,655 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:47:44,655 INFO L158 Benchmark]: Toolchain (without parser) took 3807.25ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.0MB in the beginning and 84.7MB in the end (delta: 7.3MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-11-07 10:47:44,656 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:44,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.41ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:47:44,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.36ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:44,657 INFO L158 Benchmark]: Boogie Preprocessor took 84.70ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:47:44,657 INFO L158 Benchmark]: RCFGBuilder took 782.86ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 84.1MB in the end (delta: -14.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 10:47:44,657 INFO L158 Benchmark]: TraceAbstraction took 2525.49ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 83.6MB in the beginning and 84.7MB in the end (delta: -1.1MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-07 10:47:44,658 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 84.7MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:47:44,659 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.41ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 75.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.36ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.70ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 69.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 782.86ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 84.1MB in the end (delta: -14.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2525.49ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 83.6MB in the beginning and 84.7MB in the end (delta: -1.1MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 84.7MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someUnaryFLOAToperation at line 107. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1000000000.1, 1, 8.2, -32, 100.5, 25.25, 63.6, 0.0, 0.8, -8, 8, 2, 50, 0 }; [L55] double last_1_WrapperStruct00_var_1_9 = 100.5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=201/2] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR WrapperStruct00.var_1_9 [L104] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L83] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L88] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L90] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L92] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] EXPR (WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L94] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L96] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L97] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] RET updateVariables() [L116] CALL step() [L59] COND TRUE 0.625f > last_1_WrapperStruct00_var_1_9 [L60] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L60] COND FALSE !(WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_17 [L66] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L67] EXPR WrapperStruct00.var_1_19 [L67] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L68] EXPR WrapperStruct00.var_1_19 [L68] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L69] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L69] COND FALSE !(WrapperStruct00.var_1_3) [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L74] COND TRUE WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L78] COND FALSE !(WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107-L108] return ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2555 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1786 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 769 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 22, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1100/1100 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:47:44,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:47:46,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:47:47,072 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:47:47,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:47:47,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:47:47,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:47:47,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:47:47,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:47:47,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:47:47,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:47:47,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:47:47,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:47:47,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:47:47,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:47:47,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:47:47,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:47:47,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:47:47,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:47:47,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:47,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:47:47,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:47:47,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:47:47,122 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:47:47,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:47:47,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:47:47,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:47:47,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:47:47,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:47:47,123 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2024-11-07 10:47:47,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:47:47,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:47:47,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:47:47,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:47:47,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:47:47,460 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-65.i [2024-11-07 10:47:48,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:47:48,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:47:48,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2024-11-07 10:47:49,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/398781db5/f880a04b3aec495e8753f0a2050fce4f/FLAG18c542759 [2024-11-07 10:47:49,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/398781db5/f880a04b3aec495e8753f0a2050fce4f [2024-11-07 10:47:49,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:47:49,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:47:49,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:49,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:47:49,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:47:49,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d4c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49, skipping insertion in model container [2024-11-07 10:47:49,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:47:49,197 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-65.i[916,929] [2024-11-07 10:47:49,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:49,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:47:49,301 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-65.i[916,929] [2024-11-07 10:47:49,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:47:49,391 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:47:49,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49 WrapperNode [2024-11-07 10:47:49,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:47:49,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:49,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:47:49,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:47:49,403 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:47:49" (1/1) ... [2024-11-07 10:47:49,426 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:47:49" (1/1) ... [2024-11-07 10:47:49,472 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-11-07 10:47:49,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:47:49,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:47:49,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:47:49,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:47:49,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,535 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-07 10:47:49,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:47:49,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:47:49,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:47:49,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:47:49,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (1/1) ... [2024-11-07 10:47:49,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:47:49,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:47:49,640 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:47:49,643 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:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:47:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:47:49,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:47:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:47:49,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:47:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:47:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:47:49,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:47:49,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:47:54,126 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-07 10:47:54,128 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:47:54,142 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:47:54,143 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:47:54,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:54 BoogieIcfgContainer [2024-11-07 10:47:54,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:47:54,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:47:54,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:47:54,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:47:54,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:47:49" (1/3) ... [2024-11-07 10:47:54,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c63c07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:54, skipping insertion in model container [2024-11-07 10:47:54,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:47:49" (2/3) ... [2024-11-07 10:47:54,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c63c07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:47:54, skipping insertion in model container [2024-11-07 10:47:54,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:47:54" (3/3) ... [2024-11-07 10:47:54,155 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2024-11-07 10:47:54,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:47:54,170 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:47:54,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:47:54,236 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;@3e89ec16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:47:54,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:47:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:54,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:54,250 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:54,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:54,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1938011596, now seen corresponding path program 1 times [2024-11-07 10:47:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173768250] [2024-11-07 10:47:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:54,268 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:47:54,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:54,271 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:47:54,272 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:47:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:54,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:47:54,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 10:47:54,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:54,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:54,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173768250] [2024-11-07 10:47:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173768250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:47:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655762291] [2024-11-07 10:47:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:47:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:47:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:47:54,846 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 100 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:54,873 INFO L93 Difference]: Finished difference Result 219 states and 337 transitions. [2024-11-07 10:47:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:47:54,874 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-07 10:47:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:54,879 INFO L225 Difference]: With dead ends: 219 [2024-11-07 10:47:54,880 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 10:47:54,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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:47:54,885 INFO L432 NwaCegarLoop]: 157 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, 157 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:47:54,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:47:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 10:47:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 10:47:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-07 10:47:54,926 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 112 [2024-11-07 10:47:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-07 10:47:54,927 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-07 10:47:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:54,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:54,930 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:54,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:47:55,131 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:47:55,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1962849030, now seen corresponding path program 1 times [2024-11-07 10:47:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313209222] [2024-11-07 10:47:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:55,133 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:47:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:55,137 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:47:55,138 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:47:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:55,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:47:55,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-07 10:47:55,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:55,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313209222] [2024-11-07 10:47:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313209222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:47:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679995752] [2024-11-07 10:47:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:47:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:47:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:47:55,730 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:55,825 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-07 10:47:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:47:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-07 10:47:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:55,828 INFO L225 Difference]: With dead ends: 217 [2024-11-07 10:47:55,829 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:47:55,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 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:47:55,830 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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:47:55,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:47:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:47:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 10:47:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-07 10:47:55,847 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 112 [2024-11-07 10:47:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-07 10:47:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:47:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-07 10:47:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:55,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:55,851 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:55,868 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:47:56,051 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:47:56,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 611463812, now seen corresponding path program 1 times [2024-11-07 10:47:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145681803] [2024-11-07 10:47:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:56,053 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:47:56,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:56,056 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:47:56,057 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:47:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:56,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:47:56,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:56,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:56,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145681803] [2024-11-07 10:47:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145681803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:56,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:56,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:47:56,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180132898] [2024-11-07 10:47:56,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:56,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:47:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:47:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:56,590 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:47:56,698 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-07 10:47:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:47:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:47:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:47:56,701 INFO L225 Difference]: With dead ends: 222 [2024-11-07 10:47:56,702 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:47:56,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:47:56,707 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:47:56,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:47:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:47:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 10:47:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:47:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-07 10:47:56,721 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 112 [2024-11-07 10:47:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:47:56,721 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-07 10:47:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-07 10:47:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:47:56,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:47:56,723 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:47:56,740 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:47:56,924 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:47:56,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:47:56,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:47:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2101092362, now seen corresponding path program 1 times [2024-11-07 10:47:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:47:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990069738] [2024-11-07 10:47:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:47:56,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:47:56,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:47:56,930 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:47:56,931 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:47:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:47:57,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:47:57,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:47:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:47:57,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:47:57,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:47:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990069738] [2024-11-07 10:47:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990069738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:47:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:47:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:47:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462261972] [2024-11-07 10:47:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:47:57,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:47:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:47:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:47:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:47:57,491 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:47:59,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.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:48:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:03,476 INFO L93 Difference]: Finished difference Result 266 states and 378 transitions. [2024-11-07 10:48:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:48:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-07 10:48:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:03,479 INFO L225 Difference]: With dead ends: 266 [2024-11-07 10:48:03,479 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 10:48:03,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:48:03,480 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:03,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-07 10:48:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 10:48:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2024-11-07 10:48:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2024-11-07 10:48:03,492 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 112 [2024-11-07 10:48:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:03,492 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2024-11-07 10:48:03,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2024-11-07 10:48:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:48:03,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:03,496 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:03,510 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:48:03,696 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:48:03,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:03,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash -726119745, now seen corresponding path program 1 times [2024-11-07 10:48:03,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:03,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546441379] [2024-11-07 10:48:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:03,698 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:48:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:03,700 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:48:03,702 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:48:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:04,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:48:04,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:48:04,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:04,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546441379] [2024-11-07 10:48:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546441379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:04,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:04,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543567015] [2024-11-07 10:48:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:04,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:48:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:48:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:04,203 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:04,276 INFO L93 Difference]: Finished difference Result 254 states and 362 transitions. [2024-11-07 10:48:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:48:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-07 10:48:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:04,278 INFO L225 Difference]: With dead ends: 254 [2024-11-07 10:48:04,279 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:48:04,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:04,280 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:48:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 10:48:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2024-11-07 10:48:04,287 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 113 [2024-11-07 10:48:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2024-11-07 10:48:04,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2024-11-07 10:48:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:48:04,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:04,289 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:04,306 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:48:04,490 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:48:04,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -46061375, now seen corresponding path program 1 times [2024-11-07 10:48:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40411527] [2024-11-07 10:48:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:04,491 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:48:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:04,493 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:48:04,494 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:48:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:04,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:48:04,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:48:05,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:05,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:05,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40411527] [2024-11-07 10:48:05,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40411527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:05,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:48:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069832536] [2024-11-07 10:48:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:05,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:05,040 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:05,109 INFO L93 Difference]: Finished difference Result 260 states and 367 transitions. [2024-11-07 10:48:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:48:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-07 10:48:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:05,112 INFO L225 Difference]: With dead ends: 260 [2024-11-07 10:48:05,112 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 10:48:05,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:05,113 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:05,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 730 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 10:48:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-07 10:48:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2024-11-07 10:48:05,125 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 113 [2024-11-07 10:48:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:05,126 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2024-11-07 10:48:05,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2024-11-07 10:48:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:48:05,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:05,127 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:05,142 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:48:05,328 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:48:05,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1728945987, now seen corresponding path program 1 times [2024-11-07 10:48:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789165006] [2024-11-07 10:48:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:05,329 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:48:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:05,331 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:48:05,332 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:48:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:05,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:48:05,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:48:05,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:05,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:05,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789165006] [2024-11-07 10:48:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789165006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:05,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:48:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889794280] [2024-11-07 10:48:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:05,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:05,819 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:05,923 INFO L93 Difference]: Finished difference Result 264 states and 371 transitions. [2024-11-07 10:48:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2024-11-07 10:48:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:05,925 INFO L225 Difference]: With dead ends: 264 [2024-11-07 10:48:05,925 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:05,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:05,926 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:05,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-11-07 10:48:05,940 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 113 [2024-11-07 10:48:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:05,940 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-11-07 10:48:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 10:48:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-11-07 10:48:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:48:05,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:05,941 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:05,959 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:48:06,142 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:48:06,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:06,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1730793029, now seen corresponding path program 1 times [2024-11-07 10:48:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972212512] [2024-11-07 10:48:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:06,143 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:48:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:06,145 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:48:06,146 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:48:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:06,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:48:06,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:06,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:06,736 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:48:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 10:48:06,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:06,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972212512] [2024-11-07 10:48:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972212512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:06,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:06,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924462585] [2024-11-07 10:48:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:06,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:06,776 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:10,429 INFO L93 Difference]: Finished difference Result 266 states and 372 transitions. [2024-11-07 10:48:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:10,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-07 10:48:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:10,430 INFO L225 Difference]: With dead ends: 266 [2024-11-07 10:48:10,430 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:10,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 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:48:10,431 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:10,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 383 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 10:48:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 121 states have internal predecessors, (164), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2024-11-07 10:48:10,439 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 113 [2024-11-07 10:48:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:10,439 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2024-11-07 10:48:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2024-11-07 10:48:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:48:10,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:10,441 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:10,459 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:48:10,641 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:48:10,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1067335157, now seen corresponding path program 1 times [2024-11-07 10:48:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744819894] [2024-11-07 10:48:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:10,643 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:48:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:10,645 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:48:10,646 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:48:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:11,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:48:11,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:11,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:11,254 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:48:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-07 10:48:11,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:11,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744819894] [2024-11-07 10:48:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744819894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345917177] [2024-11-07 10:48:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:11,288 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:14,771 INFO L93 Difference]: Finished difference Result 266 states and 370 transitions. [2024-11-07 10:48:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-07 10:48:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:14,773 INFO L225 Difference]: With dead ends: 266 [2024-11-07 10:48:14,773 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:14,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 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:48:14,774 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 128 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:14,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 379 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 10:48:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 185 transitions. [2024-11-07 10:48:14,781 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 185 transitions. Word has length 115 [2024-11-07 10:48:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:14,782 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 185 transitions. [2024-11-07 10:48:14,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 185 transitions. [2024-11-07 10:48:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:48:14,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:14,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:14,800 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 10:48:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:14,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1095146373, now seen corresponding path program 1 times [2024-11-07 10:48:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540067130] [2024-11-07 10:48:14,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:14,985 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:48:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:14,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:14,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:48:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:15,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:48:15,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:15,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:15,631 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 175 treesize of output 67 [2024-11-07 10:48:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-07 10:48:15,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:15,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540067130] [2024-11-07 10:48:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540067130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110687449] [2024-11-07 10:48:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:15,662 INFO L87 Difference]: Start difference. First operand 134 states and 185 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:16,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s 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:48:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:19,376 INFO L93 Difference]: Finished difference Result 266 states and 368 transitions. [2024-11-07 10:48:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-07 10:48:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:19,379 INFO L225 Difference]: With dead ends: 266 [2024-11-07 10:48:19,379 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:19,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 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:48:19,380 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 119 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:19,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 375 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-07 10:48:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 121 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2024-11-07 10:48:19,386 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 117 [2024-11-07 10:48:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:19,386 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2024-11-07 10:48:19,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2024-11-07 10:48:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:48:19,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:19,387 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:19,407 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 (11)] Ended with exit code 0 [2024-11-07 10:48:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:19,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1385705141, now seen corresponding path program 1 times [2024-11-07 10:48:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385610475] [2024-11-07 10:48:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:19,593 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:48:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:19,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:19,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 10:48:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:20,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:48:20,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:20,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:20,203 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:48:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-07 10:48:20,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:20,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385610475] [2024-11-07 10:48:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385610475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147930801] [2024-11-07 10:48:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:20,233 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:22,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s 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:48:23,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:48:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:25,236 INFO L93 Difference]: Finished difference Result 266 states and 366 transitions. [2024-11-07 10:48:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-07 10:48:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:25,238 INFO L225 Difference]: With dead ends: 266 [2024-11-07 10:48:25,238 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:25,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 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:48:25,239 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:25,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 369 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-07 10:48:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 10:48:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-11-07 10:48:25,246 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 119 [2024-11-07 10:48:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:25,247 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-11-07 10:48:25,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:48:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-11-07 10:48:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:48:25,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:25,249 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:25,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 10:48:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:25,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:25,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash -993789755, now seen corresponding path program 1 times [2024-11-07 10:48:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315672686] [2024-11-07 10:48:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:25,451 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:48:25,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:25,453 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:25,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 10:48:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:26,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 10:48:26,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:26,222 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 19 treesize of output 1 [2024-11-07 10:48:26,358 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 56 treesize of output 32 [2024-11-07 10:48:28,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:28,743 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 71 treesize of output 35 [2024-11-07 10:48:28,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:28,956 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 66 treesize of output 45 [2024-11-07 10:48:35,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:35,675 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 81 treesize of output 48 [2024-11-07 10:48:35,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:35,955 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 70 treesize of output 48 [2024-11-07 10:48:36,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:36,250 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 70 treesize of output 48 [2024-11-07 10:48:36,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:36,699 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 141 treesize of output 87 [2024-11-07 10:48:36,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:36,790 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 167 treesize of output 82 [2024-11-07 10:48:36,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:36,866 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 146 treesize of output 102 [2024-11-07 10:48:41,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:41,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 195 treesize of output 75 [2024-11-07 10:48:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 10:48:59,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:59,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315672686] [2024-11-07 10:48:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315672686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:48:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107516753] [2024-11-07 10:48:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:48:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:59,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:48:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=161, Unknown=8, NotChecked=0, Total=210 [2024-11-07 10:48:59,989 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:49:01,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s 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:49:05,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:49:09,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:49:13,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:49:17,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]