./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.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-sp_file-31.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', '367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e'] 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-sp_file-31.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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:54:28,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:54:28,852 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:54:28,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:54:28,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:54:28,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:54:28,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:54:28,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:54:28,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:54:28,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:54:28,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:54:28,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:54:28,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:54:28,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:54:28,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:54:28,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:54:28,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:54:28,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:54:28,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:54:28,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:54:28,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:54:28,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:54:28,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:54:28,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:54:28,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:54:28,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:54:28,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:54:28,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:54:28,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:54:28,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:54:28,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:54:28,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:54:28,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:54:28,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:54:28,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:54:28,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:54:28,898 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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-07 10:54:29,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:54:29,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:54:29,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:54:29,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:54:29,176 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:54:29,178 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-sp_file-31.i [2024-11-07 10:54:30,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:54:30,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:54:30,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-07 10:54:30,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d9299764/5ddd7cd5cf764420ab07699c69d6f82d/FLAGd4bb5e4a2 [2024-11-07 10:54:31,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d9299764/5ddd7cd5cf764420ab07699c69d6f82d [2024-11-07 10:54:31,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:54:31,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:54:31,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:54:31,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:54:31,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:54:31,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d722586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31, skipping insertion in model container [2024-11-07 10:54:31,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:54:31,234 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-sp_file-31.i[917,930] [2024-11-07 10:54:31,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:54:31,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:54:31,323 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-sp_file-31.i[917,930] [2024-11-07 10:54:31,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:54:31,394 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:54:31,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31 WrapperNode [2024-11-07 10:54:31,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:54:31,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:54:31,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:54:31,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:54:31,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:54:31" (1/1) ... [2024-11-07 10:54:31,417 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:54:31" (1/1) ... [2024-11-07 10:54:31,462 INFO L138 Inliner]: procedures = 30, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-07 10:54:31,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:54:31,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:54:31,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:54:31,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:54:31,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,497 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:54:31,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:54:31,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:54:31,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:54:31,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:54:31,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (1/1) ... [2024-11-07 10:54:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:54:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:54:31,582 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:54:31,583 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:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:54:31,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:54:31,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:54:31,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:54:31,742 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:54:31,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:54:32,312 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 10:54:32,313 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:54:32,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:54:32,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:54:32,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:32 BoogieIcfgContainer [2024-11-07 10:54:32,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:54:32,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:54:32,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:54:32,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:54:32,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:54:31" (1/3) ... [2024-11-07 10:54:32,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f855732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:32, skipping insertion in model container [2024-11-07 10:54:32,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:54:31" (2/3) ... [2024-11-07 10:54:32,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f855732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:54:32, skipping insertion in model container [2024-11-07 10:54:32,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:32" (3/3) ... [2024-11-07 10:54:32,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-07 10:54:32,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:54:32,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:54:32,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:54:32,408 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;@14d0ef24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:54:32,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:54:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 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:54:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:54:32,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:32,423 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] [2024-11-07 10:54:32,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -686948204, now seen corresponding path program 1 times [2024-11-07 10:54:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594152462] [2024-11-07 10:54:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:32,845 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:54:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594152462] [2024-11-07 10:54:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594152462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:54:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341101493] [2024-11-07 10:54:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:32,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:54:32,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:54:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:54:32,893 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:54:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:32,919 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2024-11-07 10:54:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:54:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-07 10:54:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:32,926 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:54:32,926 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 10:54:32,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:54:32,931 INFO L432 NwaCegarLoop]: 121 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, 121 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:54:32,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:54:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 10:54:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 10:54:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 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:54:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-07 10:54:32,967 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2024-11-07 10:54:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-07 10:54:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 10:54:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-07 10:54:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:54:32,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:32,970 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] [2024-11-07 10:54:32,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:54:32,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 862036710, now seen corresponding path program 1 times [2024-11-07 10:54:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714389968] [2024-11-07 10:54:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:33,457 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:54:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714389968] [2024-11-07 10:54:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714389968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:33,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:54:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163882060] [2024-11-07 10:54:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:33,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:54:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:33,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:54:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:54:33,462 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:54:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:33,611 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2024-11-07 10:54:33,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:54:33,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 94 [2024-11-07 10:54:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:33,614 INFO L225 Difference]: With dead ends: 163 [2024-11-07 10:54:33,616 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 10:54:33,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:54:33,617 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:33,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:54:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 10:54:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 10:54:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 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:54:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-07 10:54:33,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2024-11-07 10:54:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:33,633 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-07 10:54:33,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:54:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-07 10:54:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:54:33,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:33,635 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] [2024-11-07 10:54:33,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:54:33,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:33,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash -726311192, now seen corresponding path program 1 times [2024-11-07 10:54:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781305066] [2024-11-07 10:54:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,331 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:54:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781305066] [2024-11-07 10:54:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781305066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:36,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:54:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482641459] [2024-11-07 10:54:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:36,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:54:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:54:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:54:36,336 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:54:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:37,051 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2024-11-07 10:54:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:54:37,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 94 [2024-11-07 10:54:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:37,055 INFO L225 Difference]: With dead ends: 199 [2024-11-07 10:54:37,055 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:54:37,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:54:37,057 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 312 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:37,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 290 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:54:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:54:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2024-11-07 10:54:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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:54:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-07 10:54:37,081 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 94 [2024-11-07 10:54:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-07 10:54:37,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:54:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-07 10:54:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:54:37,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:37,083 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] [2024-11-07 10:54:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:54:37,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1593160989, now seen corresponding path program 1 times [2024-11-07 10:54:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661875629] [2024-11-07 10:54:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:37,388 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:54:37,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661875629] [2024-11-07 10:54:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661875629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:37,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:54:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109063070] [2024-11-07 10:54:37,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:37,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:54:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:37,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:54:37,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:54:37,391 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:54:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:37,417 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-07 10:54:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:54:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 96 [2024-11-07 10:54:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:37,419 INFO L225 Difference]: With dead ends: 171 [2024-11-07 10:54:37,419 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 10:54:37,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:54:37,420 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:37,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:54:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 10:54:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 10:54:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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:54:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-11-07 10:54:37,439 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 96 [2024-11-07 10:54:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:37,440 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-11-07 10:54:37,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:54:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-11-07 10:54:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:54:37,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:37,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] [2024-11-07 10:54:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:54:37,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1986187999, now seen corresponding path program 1 times [2024-11-07 10:54:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812791109] [2024-11-07 10:54:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:39,792 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:54:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812791109] [2024-11-07 10:54:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812791109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:54:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380989590] [2024-11-07 10:54:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:54:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:54:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:54:39,795 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:40,738 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2024-11-07 10:54:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2024-11-07 10:54:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:40,740 INFO L225 Difference]: With dead ends: 175 [2024-11-07 10:54:40,740 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:54:40,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:54:40,741 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 282 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 327 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:54:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:54:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-07 10:54:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 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:54:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-07 10:54:40,759 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 96 [2024-11-07 10:54:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:40,760 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-07 10:54:40,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-07 10:54:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:54:40,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:40,764 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] [2024-11-07 10:54:40,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:54:40,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 798189168, now seen corresponding path program 1 times [2024-11-07 10:54:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:40,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044724463] [2024-11-07 10:54:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,071 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:54:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044724463] [2024-11-07 10:54:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044724463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:54:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974122353] [2024-11-07 10:54:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:41,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:54:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:41,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:54:41,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:54:41,075 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:54:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:41,369 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2024-11-07 10:54:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:54:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 96 [2024-11-07 10:54:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:41,371 INFO L225 Difference]: With dead ends: 209 [2024-11-07 10:54:41,371 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 10:54:41,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:54:41,372 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 126 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:41,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:54:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 10:54:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2024-11-07 10:54:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 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:54:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-07 10:54:41,387 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 96 [2024-11-07 10:54:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:41,387 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-07 10:54:41,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:54:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-07 10:54:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:54:41,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:41,390 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] [2024-11-07 10:54:41,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:54:41,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:41,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1477097076, now seen corresponding path program 1 times [2024-11-07 10:54:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:41,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044441621] [2024-11-07 10:54:41,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:41,548 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:54:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:41,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044441621] [2024-11-07 10:54:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044441621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120087095] [2024-11-07 10:54:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:41,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:54:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:54:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:54:41,550 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:54:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:41,590 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2024-11-07 10:54:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:54:41,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 97 [2024-11-07 10:54:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:41,593 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:54:41,594 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:54:41,594 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:54:41,595 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:41,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:54:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:54:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-07 10:54:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 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:54:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-07 10:54:41,619 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 97 [2024-11-07 10:54:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:41,619 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-07 10:54:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:54:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-07 10:54:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:54:41,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:41,621 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] [2024-11-07 10:54:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:54:41,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1218931638, now seen corresponding path program 1 times [2024-11-07 10:54:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927224705] [2024-11-07 10:54:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:43,038 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:54:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927224705] [2024-11-07 10:54:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927224705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:54:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591295371] [2024-11-07 10:54:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:43,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:54:43,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:54:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:54:43,041 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:43,592 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2024-11-07 10:54:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:54:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-07 10:54:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:43,594 INFO L225 Difference]: With dead ends: 206 [2024-11-07 10:54:43,594 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:54:43,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:54:43,595 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 390 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:43,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 266 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:54:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:54:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2024-11-07 10:54:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 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:54:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-07 10:54:43,620 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 97 [2024-11-07 10:54:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:43,620 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-07 10:54:43,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-07 10:54:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:54:43,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:43,621 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] [2024-11-07 10:54:43,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:54:43,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 721006156, now seen corresponding path program 1 times [2024-11-07 10:54:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486564654] [2024-11-07 10:54:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:46,034 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:54:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486564654] [2024-11-07 10:54:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486564654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:54:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756237162] [2024-11-07 10:54:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:54:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:54:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:54:46,039 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:48,006 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2024-11-07 10:54:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:54:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-07 10:54:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:48,008 INFO L225 Difference]: With dead ends: 264 [2024-11-07 10:54:48,009 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 10:54:48,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:54:48,011 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 534 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:48,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 494 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:54:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 10:54:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2024-11-07 10:54:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 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:54:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2024-11-07 10:54:48,032 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 98 [2024-11-07 10:54:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2024-11-07 10:54:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2024-11-07 10:54:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:54:48,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:48,034 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] [2024-11-07 10:54:48,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:54:48,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1669998802, now seen corresponding path program 1 times [2024-11-07 10:54:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445324860] [2024-11-07 10:54:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:48,326 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:54:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445324860] [2024-11-07 10:54:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445324860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:54:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523213348] [2024-11-07 10:54:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:54:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:54:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:54:48,328 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:54:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:48,631 INFO L93 Difference]: Finished difference Result 302 states and 411 transitions. [2024-11-07 10:54:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:54:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 99 [2024-11-07 10:54:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:48,633 INFO L225 Difference]: With dead ends: 302 [2024-11-07 10:54:48,635 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 10:54:48,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:54:48,636 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 127 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:48,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 541 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:54:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 10:54:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 131. [2024-11-07 10:54:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 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:54:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2024-11-07 10:54:48,654 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 99 [2024-11-07 10:54:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:48,655 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2024-11-07 10:54:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:54:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2024-11-07 10:54:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:54:48,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:48,656 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] [2024-11-07 10:54:48,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:54:48,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1603900140, now seen corresponding path program 1 times [2024-11-07 10:54:48,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:48,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402939140] [2024-11-07 10:54:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:49,403 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:54:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402939140] [2024-11-07 10:54:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402939140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:49,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:54:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657096681] [2024-11-07 10:54:49,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:49,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:54:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:54:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:54:49,406 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:50,022 INFO L93 Difference]: Finished difference Result 314 states and 435 transitions. [2024-11-07 10:54:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:54:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2024-11-07 10:54:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:50,024 INFO L225 Difference]: With dead ends: 314 [2024-11-07 10:54:50,024 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 10:54:50,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:54:50,026 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 213 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:50,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 402 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:54:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 10:54:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2024-11-07 10:54:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 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:54:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-07 10:54:50,048 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 99 [2024-11-07 10:54:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:50,048 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-07 10:54:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 10:54:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-07 10:54:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:54:50,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:50,050 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] [2024-11-07 10:54:50,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:54:50,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 15552238, now seen corresponding path program 1 times [2024-11-07 10:54:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740175649] [2024-11-07 10:54:50,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:54:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:54:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:54:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:54:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:54:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:54:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:54:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:54:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:54:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:54:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:54:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,252 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:54:50,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:54:50,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740175649] [2024-11-07 10:54:50,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740175649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:50,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:50,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274612100] [2024-11-07 10:54:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:50,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:54:50,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:54:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:54:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:54:50,255 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:54:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:50,394 INFO L93 Difference]: Finished difference Result 312 states and 425 transitions. [2024-11-07 10:54:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:54:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 99 [2024-11-07 10:54:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:50,396 INFO L225 Difference]: With dead ends: 312 [2024-11-07 10:54:50,396 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 10:54:50,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:54:50,397 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 84 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:50,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:54:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 10:54:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 129. [2024-11-07 10:54:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 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:54:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2024-11-07 10:54:50,414 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 99 [2024-11-07 10:54:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:50,416 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2024-11-07 10:54:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:54:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2024-11-07 10:54:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:54:50,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:50,417 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] [2024-11-07 10:54:50,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:54:50,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -949172821, now seen corresponding path program 1 times [2024-11-07 10:54:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:54:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058981017] [2024-11-07 10:54:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:54:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:54:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86940636] [2024-11-07 10:54:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:50,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:54:50,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:54:50,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:54:50,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:54:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:50,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-07 10:54:50,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:50,879 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 37 treesize of output 36 [2024-11-07 10:54:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2024-11-07 10:54:51,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:54:52,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:54:52,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:54:53,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:54:53,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:54:54,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 10:54:54,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 10:54:54,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:54:54,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 43 [2024-11-07 10:54:54,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:54,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:54:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2024-11-07 10:54:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 69 proven. 61 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-07 10:54:54,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:55:07,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (* (- 2) (mod (select (select .cse1 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)) (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))))))) (or (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|) (not (= v_ArrVal_991 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))) is different from false [2024-11-07 10:55:07,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_990 Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_990)))) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (select (select .cse2 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* (- 2) (mod (select (select .cse2 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)))))))) (or (not (= v_ArrVal_991 (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|))))) is different from false [2024-11-07 10:55:07,370 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_step_#t~mem4#1_10| Int)) (or (< |v_ULTIMATE.start_step_#t~mem4#1_10| (select (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (< (select (select |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_step_#t~mem4#1_10|)))) (forall ((v_ArrVal_990 Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_990)))) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (select (select .cse2 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* (- 2) (mod (select (select .cse2 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)))))))) (or (not (= v_ArrVal_991 (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|)))))) is different from false [2024-11-07 10:55:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058981017] [2024-11-07 10:55:07,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:55:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86940636] [2024-11-07 10:55:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86940636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:55:07,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:55:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-07 10:55:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966251283] [2024-11-07 10:55:07,493 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 10:55:07,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:55:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:55:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=289, Unknown=4, NotChecked=108, Total=462 [2024-11-07 10:55:07,496 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:55:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:09,331 INFO L93 Difference]: Finished difference Result 483 states and 650 transitions. [2024-11-07 10:55:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 10:55:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2024-11-07 10:55:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:09,333 INFO L225 Difference]: With dead ends: 483 [2024-11-07 10:55:09,333 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 10:55:09,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=216, Invalid=784, Unknown=4, NotChecked=186, Total=1190 [2024-11-07 10:55:09,335 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 447 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:09,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 733 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:55:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 10:55:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 207. [2024-11-07 10:55:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:55:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2024-11-07 10:55:09,365 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 99 [2024-11-07 10:55:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2024-11-07 10:55:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-07 10:55:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2024-11-07 10:55:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:55:09,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:09,367 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] [2024-11-07 10:55:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:55:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 10:55:09,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1418951654, now seen corresponding path program 1 times [2024-11-07 10:55:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289462003] [2024-11-07 10:55:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:55:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:55:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:09,715 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:55:09,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:09,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289462003] [2024-11-07 10:55:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289462003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:09,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:09,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:55:09,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547199396] [2024-11-07 10:55:09,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:09,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:55:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:55:09,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:55:09,717 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:55:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:09,771 INFO L93 Difference]: Finished difference Result 337 states and 457 transitions. [2024-11-07 10:55:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:55:09,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 100 [2024-11-07 10:55:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:09,773 INFO L225 Difference]: With dead ends: 337 [2024-11-07 10:55:09,773 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 10:55:09,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:55:09,774 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:09,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 10:55:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-07 10:55:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 181 states have internal predecessors, (236), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:55:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2024-11-07 10:55:09,808 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 100 [2024-11-07 10:55:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2024-11-07 10:55:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:55:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2024-11-07 10:55:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:55:09,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:09,810 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] [2024-11-07 10:55:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:55:09,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:09,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1251915825, now seen corresponding path program 1 times [2024-11-07 10:55:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893069802] [2024-11-07 10:55:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:55:09,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317689592] [2024-11-07 10:55:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:09,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:55:09,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:55:09,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:55:09,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 10:55:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:55:10,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:55:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:55:10,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:55:10,843 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:55:10,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:55:10,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:55:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 10:55:11,050 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:11,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:55:11,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:55:11 BoogieIcfgContainer [2024-11-07 10:55:11,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:55:11,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:55:11,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:55:11,163 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:55:11,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:54:32" (3/4) ... [2024-11-07 10:55:11,165 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:55:11,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:55:11,166 INFO L158 Benchmark]: Toolchain (without parser) took 40090.66ms. Allocated memory was 100.7MB in the beginning and 444.6MB in the end (delta: 343.9MB). Free memory was 76.5MB in the beginning and 173.8MB in the end (delta: -97.2MB). Peak memory consumption was 246.1MB. Max. memory is 16.1GB. [2024-11-07 10:55:11,166 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.17ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 61.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.82ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 58.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: Boogie Preprocessor took 75.80ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 56.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: RCFGBuilder took 779.06ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 64.1MB in the end (delta: -7.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: TraceAbstraction took 38838.66ms. Allocated memory was 100.7MB in the beginning and 444.6MB in the end (delta: 343.9MB). Free memory was 63.2MB in the beginning and 173.9MB in the end (delta: -110.7MB). Peak memory consumption was 232.7MB. Max. memory is 16.1GB. [2024-11-07 10:55:11,167 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 444.6MB. Free memory was 173.9MB in the beginning and 173.8MB in the end (delta: 112.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:55:11,168 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.42ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.17ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 61.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.82ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 58.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.80ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 56.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 779.06ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 64.1MB in the end (delta: -7.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38838.66ms. Allocated memory was 100.7MB in the beginning and 444.6MB in the end (delta: 343.9MB). Free memory was 63.2MB in the beginning and 173.9MB in the end (delta: -110.7MB). Peak memory consumption was 232.7MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 444.6MB. Free memory was 173.9MB in the beginning and 173.8MB in the end (delta: 112.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 200, 0, 1107940323, 0, 4, -32, 64, 4, 0.97, 32.6 }; [L47] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L49] signed long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L57] signed long int last_1_WrapperStruct00_var_1_7 = 4; [L58] double last_1_WrapperStruct00_var_1_13 = 0.97; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_7 [L117] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] WrapperStruct00.var_1_3 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L107] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && 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}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && 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}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && 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}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L129] RET updateVariables() [L130] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L62] COND FALSE !(! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) [L69] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L69] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L71] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L76] COND FALSE !(((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L87] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_1_Pointer)) = (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121-L122] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2521 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2515 mSDsluCounter, 5384 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3934 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4018 IncrementalHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 1450 mSDtfsCounter, 4018 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=14, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 447 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1657 NumberOfCodeBlocks, 1657 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1344 ConstructedInterpolants, 8 QuantifiedInterpolants, 15267 SizeOfPredicates, 17 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 3019/3080 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:55:11,207 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-sp_file-31.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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:55:13,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:55:13,517 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:55:13,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:55:13,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:55:13,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:55:13,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:55:13,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:55:13,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:55:13,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:55:13,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:55:13,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:55:13,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:55:13,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:55:13,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:55:13,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:55:13,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:55:13,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:55:13,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:55:13,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:55:13,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:55:13,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:55:13,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:55:13,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:55:13,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:55:13,560 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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-07 10:55:13,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:55:13,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:55:13,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:55:13,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:55:13,862 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:55:13,863 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-sp_file-31.i [2024-11-07 10:55:15,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:55:15,471 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:55:15,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-07 10:55:15,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/241c5a6aa/cbe520ebc2384312a73622ba5538d213/FLAGc0474207c [2024-11-07 10:55:15,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/241c5a6aa/cbe520ebc2384312a73622ba5538d213 [2024-11-07 10:55:15,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:55:15,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:55:15,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:55:15,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:55:15,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:55:15,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4793070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15, skipping insertion in model container [2024-11-07 10:55:15,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:55:15,653 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-sp_file-31.i[917,930] [2024-11-07 10:55:15,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:55:15,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:55:15,759 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-sp_file-31.i[917,930] [2024-11-07 10:55:15,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:55:15,824 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:55:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15 WrapperNode [2024-11-07 10:55:15,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:55:15,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:55:15,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:55:15,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:55:15,835 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:55:15" (1/1) ... [2024-11-07 10:55:15,851 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:55:15" (1/1) ... [2024-11-07 10:55:15,894 INFO L138 Inliner]: procedures = 34, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-07 10:55:15,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:55:15,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:55:15,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:55:15,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:55:15,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,936 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-07 10:55:15,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:15,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:55:15,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:55:15,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:55:15,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:55:15,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (1/1) ... [2024-11-07 10:55:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:55:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:55:16,028 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:55:16,030 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:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:55:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:55:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:55:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:55:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:55:16,176 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:55:16,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:55:16,976 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 10:55:16,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:55:16,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:55:16,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:55:16,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:55:16 BoogieIcfgContainer [2024-11-07 10:55:16,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:55:16,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:55:16,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:55:16,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:55:16,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:55:15" (1/3) ... [2024-11-07 10:55:16,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2452da90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:55:16, skipping insertion in model container [2024-11-07 10:55:16,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:15" (2/3) ... [2024-11-07 10:55:16,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2452da90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:55:16, skipping insertion in model container [2024-11-07 10:55:16,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:55:16" (3/3) ... [2024-11-07 10:55:17,000 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-07 10:55:17,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:55:17,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:55:17,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:55:17,064 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;@616d74df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:55:17,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:55:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 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:55:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:55:17,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:17,077 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] [2024-11-07 10:55:17,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2081525877, now seen corresponding path program 1 times [2024-11-07 10:55:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002378484] [2024-11-07 10:55:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:17,094 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:55:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:17,097 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:55:17,098 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:55:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:17,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:55:17,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-07 10:55:17,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:55:17,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002378484] [2024-11-07 10:55:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002378484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:55:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999581079] [2024-11-07 10:55:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:17,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:55:17,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:55:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:55:17,493 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:55:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:17,516 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-07 10:55:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:55:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 94 [2024-11-07 10:55:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:17,523 INFO L225 Difference]: With dead ends: 164 [2024-11-07 10:55:17,523 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 10:55:17,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:55:17,528 INFO L432 NwaCegarLoop]: 114 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, 114 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:55:17,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 10:55:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 10:55:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 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:55:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-07 10:55:17,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-07 10:55:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-07 10:55:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:55:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-07 10:55:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:55:17,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:17,569 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] [2024-11-07 10:55:17,577 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:55:17,770 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:55:17,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:17,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -532540963, now seen corresponding path program 1 times [2024-11-07 10:55:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193075192] [2024-11-07 10:55:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:17,772 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:55:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:17,774 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:55:17,775 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:55:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:18,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:55:18,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:55:18,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:55:18,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:18,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193075192] [2024-11-07 10:55:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193075192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:18,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:18,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:55:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063053736] [2024-11-07 10:55:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:55:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:55:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:55:18,086 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:55:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:18,153 INFO L93 Difference]: Finished difference Result 159 states and 228 transitions. [2024-11-07 10:55:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:55:18,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 94 [2024-11-07 10:55:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:18,156 INFO L225 Difference]: With dead ends: 159 [2024-11-07 10:55:18,157 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 10:55:18,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 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:55:18,159 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 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:55:18,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:55:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 10:55:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 10:55:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 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:55:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-07 10:55:18,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 94 [2024-11-07 10:55:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:18,188 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-07 10:55:18,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:55:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-07 10:55:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:55:18,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:18,195 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] [2024-11-07 10:55:18,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:55:18,396 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:55:18,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1918744357, now seen corresponding path program 1 times [2024-11-07 10:55:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850300786] [2024-11-07 10:55:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:18,398 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:55:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:18,400 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:55:18,401 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:55:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:18,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:55:18,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:18,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:55:18,769 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:55:18,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:55:18,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850300786] [2024-11-07 10:55:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850300786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:55:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584409991] [2024-11-07 10:55:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:55:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:18,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:55:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:55:18,774 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:55:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:18,808 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2024-11-07 10:55:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:55:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 94 [2024-11-07 10:55:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:18,810 INFO L225 Difference]: With dead ends: 161 [2024-11-07 10:55:18,810 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 10:55:18,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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:55:18,811 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:18,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 10:55:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 10:55:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 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:55:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-11-07 10:55:18,827 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 94 [2024-11-07 10:55:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-11-07 10:55:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:55:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-11-07 10:55:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:55:18,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:18,830 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] [2024-11-07 10:55:18,841 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:55:19,030 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:55:19,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 787875037, now seen corresponding path program 1 times [2024-11-07 10:55:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592327258] [2024-11-07 10:55:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:19,032 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:55:19,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:19,036 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:55:19,038 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:55:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:19,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:55:19,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:20,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-07 10:55:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:55:21,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:55:21,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592327258] [2024-11-07 10:55:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592327258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:55:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271779187] [2024-11-07 10:55:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:21,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:55:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:55:21,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:55:21,135 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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:55:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:22,064 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2024-11-07 10:55:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:55:22,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 94 [2024-11-07 10:55:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:22,067 INFO L225 Difference]: With dead ends: 195 [2024-11-07 10:55:22,067 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:55:22,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:55:22,068 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 105 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:22,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 292 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:55:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:55:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2024-11-07 10:55:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 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:55:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-11-07 10:55:22,084 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 94 [2024-11-07 10:55:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:22,084 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-11-07 10:55:22,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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:55:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-07 10:55:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:55:22,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:22,085 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] [2024-11-07 10:55:22,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 10:55:22,286 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:55:22,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1840859288, now seen corresponding path program 1 times [2024-11-07 10:55:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777311863] [2024-11-07 10:55:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:22,288 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:55:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:22,291 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:55:22,293 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:55:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:22,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:55:22,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:55:22,598 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:55:22,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:55:22,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777311863] [2024-11-07 10:55:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777311863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:55:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053064317] [2024-11-07 10:55:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:55:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:55:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:55:22,600 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:55:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:22,628 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2024-11-07 10:55:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:55:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 96 [2024-11-07 10:55:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:22,629 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:55:22,629 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:55:22,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:55:22,631 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:22,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:55:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:55:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 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:55:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-11-07 10:55:22,644 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 96 [2024-11-07 10:55:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:22,644 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-11-07 10:55:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:55:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-11-07 10:55:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:55:22,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:22,648 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] [2024-11-07 10:55:22,657 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:55:22,849 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:55:22,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:22,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1447832278, now seen corresponding path program 1 times [2024-11-07 10:55:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:55:22,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937207323] [2024-11-07 10:55:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:22,850 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:55:22,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:55:22,853 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:55:22,853 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:55:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:23,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 10:55:23,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:55:24,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:55:24,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:55:25,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:55:25,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-07 10:55:26,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2024-11-07 10:55:29,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2024-11-07 10:55:29,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2024-11-07 10:55:29,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2024-11-07 10:55:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 88 [2024-11-07 10:55:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 109 proven. 61 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-07 10:55:35,081 INFO L311 TraceCheckSpWp]: Computing backward predicates...